Finite Model Theory and Finite Variable Logics
| dc.contributor.author | Rosen, Eric | |
| dc.date | 2023-05-16T23:49:45.000 | |
| dc.date.accessioned | 2023-05-22T19:57:39Z | |
| dc.date.available | 2023-05-22T19:57:39Z | |
| dc.date.issued | 1995-10-01 | |
| dc.date.submitted | 2006-09-08T10:42:19-07:00 | |
| dc.description.abstract | In this dissertation, I investigate some questions about the model theory of finite structures. One goal is to better understand the expressive power of various logical languages, including first order logic (FO), over this class. A second, related, goal is to determine which results from classical model theory remain true when relativized to the class, F, of finite structures. As it is well known that many such results become false, I also consider certain weakened generalizations of classical results. I prove some basic results about the languages Lk∃ and Lk∞ω∃, the existential fragments of the finite variable logics Lk and Lk∞ω. I show that there are finite models whose Lk(∃)-theories are not finitely axiomatizable. I also establish the optimality of a normal form for Lk∞ω∃, and separate certain fragments of this logic. I introduce a notion of a "generalized preservation theorem", and establish certain partial positive results. I then show that existential preservation fails for the language Lk∞ω, both over F and over the class of all structures. I also examine other preservation properties, e.g. for classes closed under homomorphisms. In the final chapter, I investigate the finite model theory of propositional modal logic. I show that, in contrast to more expressive logics, model logic is "well behaved" over F. In particular, I establish that various theorems that are true over the class of all structures also hold over F. I prove that, over F a class of models is FO-definable and closed under bisimulations if it is defined by a modal FO sentence. In addition, I prove that, over F, a class is defined by a modal sentence and closed under extensions if it is defined by a ◊-modal sentence. | |
| dc.description.comments | University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-28. | |
| dc.identifier.uri | https://repository.upenn.edu/handle/20.500.14332/37552 | |
| dc.legacy.articleid | 1139 | |
| dc.legacy.fulltexturl | https://repository.upenn.edu/cgi/viewcontent.cgi?article=1139&context=ircs_reports&unstamped=1 | |
| dc.source.issue | 139 | |
| dc.source.journal | IRCS Technical Reports Series | |
| dc.source.status | published | |
| dc.title | Finite Model Theory and Finite Variable Logics | |
| dc.type | Dissertation/Thesis | |
| digcom.contributor.author | Rosen, Eric | |
| digcom.identifier | ircs_reports/139 | |
| digcom.identifier.contextkey | 203409 | |
| digcom.identifier.submissionpath | ircs_reports/139 | |
| digcom.type | thesis | |
| dspace.entity.type | Publication | |
| upenn.schoolDepartmentCenter | IRCS Technical Reports Series |
Files
Original bundle
1 - 1 of 1