Finite relation algebras and omitting types in modal fragments of first order logic
Tarek Sayed Ahmed

TL;DR
This paper investigates the failure of the omitting types theorem in finite variable fragments of first-order logic under clique guarded semantics, revealing new limitations and conditions for positive results.
Contribution
It demonstrates the dramatic failure of the omitting types theorem in certain modal fragments of first-order logic and establishes conditions under which positive results can still be obtained.
Findings
Failure of omitting types theorem for n-variable fragments with clique guarded semantics.
Existence of finite relation algebras with strong l-blurs and no m-dimensional relational basis.
Positive results on omitting types under additional conditions for L_n and its extensions.
Abstract
Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded semantics, and for its packed n--variable fragments. Both are modal fragments of L_n. As a sample, we show that if there exists a finite relation algebra with a so--called strong l--blur, and no m--dimensional relational basis, then there exists a countable, atomic and complete L_n theory T and type \Gamma, such that \Gamma is realizable in every so--called m--square model of T, but any witness isolating \Gamma cannot use less than variables. An --square model M of T gives a form of clique guarded semantics, where the parameter m, measures how locally well behaved M is. Every ordinary model is k--square for any n<k<\omega, but the converse is not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Software Testing and Debugging Techniques
