Borel complexity and potential canonical Scott sentences

DOI10.4064/FM326-11-2016MaRDI QIDQ5348072zbMATH OpenOpenAlexFDO

Authors Douglas Ulrich, Richard Rast, M. C. Laskowski

Publication date 11 August 2017

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.05679

zbMATH Keywords

Borel reducibilitycanonical Scott sentence

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15) Set-theoretic model theory (03C55)

Abstract: We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences Phi of $L_{omeg{a}_1,omega}$, which counts the number of sentences of $L_{infty,omega}$ that, in some forcing extension, become a canonical Scott sentence of a model of Phi. We show this cardinal bounds the complexity of (Mod(Phi), iso), the class of models of Phi with universe omega, by proving that (Mod(Phi),iso) is not Borel reducible to (Mod(Psi),iso) whenever ||Psi|| < ||Phi||. Using these tools, we analyze the complexity of the class of countable models of four complete, first-order theories T for which (Mod(T),iso) is properly analytic, yet admit very different behavior. We prove that both `Binary splitting, refining equivalence relations' and Koerwien's example of an eni-depth 2, omega-stable theory have (Mod(T),iso) non-Borel, yet neither is Borel complete. We give a slight modification of Koerwien's example that also is omega-stable, eni-depth 2, but is Borel complete. Additionally, we prove that I_{infty,omega}(Phi)<�eth_{omega_1} whenever (Mod(Phi),iso) is Borel.

Recommendations

• A complicated -stable depth 2 theory
• A Borel reductibility theory for classes of countable structures
• The classification of countable models of set theory
• Borel equivalence relations and classifications of countable models
• scientific article; zbMATH DE number 2204765

Cited in

(16)

• The Borel complexity of isomorphism for theories with many types
• Characterizing the existence of a Borel complete expansion
• Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension
• The Borel complexity of isomorphism for o-minimal theories
• Borel complexity of families of finite equivalence relations via large cardinals
• An old friend revisited: countable models of \(\omega\)-stable theories
• MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
• Borel sets, countable models
• Classifying invariants for E₁: a tail of a generic real
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Complexity of Scott sentences
• New jump operators on equivalence relations
• A Borel reductibility theory for classes of countable structures
• The classification of countable models of set theory
• A strong failure of \(\aleph _0\)-stability for atomic classes
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

This page was built for publication: Borel complexity and potential canonical Scott sentences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348072)