The Borel complexity of the class of models of first-order theories
Abstract
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a ω0-complete set of models. In particular, any sequential theory (a class of foundational theories isolated by Pudl\'ak) has a ω0-complete set of models. We also give sharp conditions for theories to have a 0n-complete set of models.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.