On completions, neat embeddings and omittings types, yet again
Tarek Sayed Ahmed

TL;DR
This paper explores deep algebraic logic results to prove new omitting types theorems for finite variable fragments of first order logic, revealing limitations and connections in algebraic and logical frameworks.
Contribution
It introduces new omitting types theorems for L_n, demonstrates failures under clique guarded semantics, and explores connections between strong and complete representability using rainbow and Monk-like constructions.
Findings
Proves that theories with quantifier elimination omit fewer types than possible.
Shows failure of omitting types theorem for L_n under clique guarded semantics.
Constructs examples illustrating the limits of representability and omitting types in algebraic logic.
Abstract
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and |T|=lambda, lambda a regular cardinal, if T admits elimination of quantifiers, then T omits < 2^{\lambda} many non isolated {\it maximal} types. This is basically a result of Shelah's restricted to L_n. that is not completely representable. We also show, using a rainbow construction for cylindric algebras, that the omitting types theorem fails for L_n even if we consider clique guarded semantics. This is done by constructing a an atomic \A\in \PEA_n with countably many atoms (which are coloured graphs) who Sc (Pinter's) reduct is not in S_c\Nr_n\Sc_{n+3}, but is elementary equivalent to a countable completely representable (polyadic equality)…
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
TopicsLogic, programming, and type systems · semigroups and automata theory · Logic, Reasoning, and Knowledge
