Constructing many atomic models in $\aleph_1$
John T. Baldwin (U. Ill. Chicago), Michael C. Laskowski (U. of, Maryland), Saharon Shelah (Hebrew University, Jerusalem)

TL;DR
This paper introduces pseudo-algebraicity to analyze atomic models of first-order theories, showing that under certain conditions, there are many non-isomorphic atomic models of size .
Contribution
It establishes a new approach using pseudo-algebraicity to construct numerous atomic models in size for theories with non-dense pseudo-minimal types.
Findings
If pseudo-minimal types are not dense, then there are 2^{} non-isomorphic atomic models of size .
The notion of pseudo-algebraicity helps in understanding the diversity of atomic models.
The results apply to any complete first-order theory with an atomic model in a countable language.
Abstract
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of . Theorem: Let be any complete first-order theory in a countable language with an atomic model. If the pseudo-minimal types are not dense, then there are pairwise non-isomorphic atomic models of , each of size .
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
TopicsComputability, Logic, AI Algorithms · Complexity and Algorithms in Graphs
