An instance of Vaught's conjecture using algebraic logic
Mohammed Assem, Tarek Sayed Ahmed

TL;DR
This paper proves Vaught's conjecture for countable models using algebraic logic, employing descriptive set theory and representation theory of algebras, and extends results to infinitary logic and models omitting certain types.
Contribution
It introduces algebraic logic techniques to establish Vaught's conjecture, especially for models without equality, and develops a new framework for analyzing model distinguishability.
Findings
Number of distinguishable models satisfies the Glimm Effross dichotomy.
Equivalence relation on models is a Borel subset in the algebraic setting.
Counts non-isomorphic models omitting certain types under set-theoretic assumptions.
Abstract
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that the number of distinguishable countable models for a complete countable first order theory, satisfies the Glimm Effross dichotomy, hence also Vaught's conjecture. The proof in the presence of equality is fairly easy, though we need infinite conjunctions to implement it and somewhat heavy theorems from descriptive set theory. However, the case without equality seems to be much more difficult (because we cannot count without equality) and in this case algebraic logic comes to our rescue via the representation theory of locally finite quasi polyadic algebras. We show that the equivalence relation induced by such (indistinguishable) models is a Borel…
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
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Algebra and Logic
