Problem #1
Vaught's Conjecture
Let be a complete first-order theory in a countable language, and let denote the number of countable models of up to isomorphism. Vaught's Conjecture states that
In other words, a complete countable theory cannot have a number of countable models that is strictly between countable and continuum many.
Reference for the problem statement
Robert L. Vaught, Denumerable models of complete theories, Infinitistic Methods (Proc. Symposium on Foundations of Mathematics, Warsaw), 1961
Definitions
- Complete theory: a theory such that for every sentence in its language, either or .
- : the number of pairwise non-isomorphic countable models of .
Known Partial Results
- The conjecture is known to hold for theories that are -stable (Shelah, Harrington, Makkai).
- It is also known for theories of trees and for various other restricted classes.
- By a theorem of Morley, if has uncountably many countable models, it has either exactly or exactly many — so under CH the conjecture is trivial, but the independent case remains genuinely open.
Notes
Vaught's Conjecture is widely regarded as one of the central open problems in model theory, with deep connections to descriptive set theory (via the Topological Vaught Conjecture) and to the theory of equivalence relations.
Additional References
- Vaught, R. L. "Denumerable models of complete theories." Infinitistic Methods, 1961.
- Shelah, S. "Classification Theory." North-Holland, 1978 (revised edition 1990).
- Steel, J. "On Vaught's conjecture." Cabal Seminar 76–77, Lecture Notes in Mathematics, 1978.
Loading comments…