The classification of countable models of set theory

DOI10.1002/MALQ.201900008MaRDI QIDQ5119907zbMATH OpenOpenAlexFDO

Authors John D. Clemens, Samuel Coskey, Samuel Dworetzky

Publication date 9 September 2020

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• The complexity of classification problems for models of arithmetic
• Borel sets, countable models
• Counting models of set theory
• Borel complexity and potential canonical Scott sentences
• On ‐complete equivalence relations on the generalized Baire space

Cites work

• A Borel reductibility theory for classes of countable structures
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• An absoluteness principle for Borel sets
• Counting models of set theory
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• Infinite time computable model theory
• Infinite time decidable equivalence relation theory
• Infinite time Turing machines
• Intermediate submodels and generic extensions in set theory
• Invariant descriptive set theory
• Model Theory
• Models and types of Peano's arithmetic
• Set Theory
• The complexity of classification problems for models of arithmetic
• The structure of models of Peano arithmetic

Cited in

(19)

• The model \(N=\cup \{L[A]:\) A countable set of ordinals\(\}\)
• Countable models and unions of theories
• Some applications of illfoundedness
• Equivalence of generics
• A model of intuitionistic analysis in which -definable discrete sets are subcountable
• The complexity of classification problems for models of arithmetic
• Representing Sets of Ordinals as Countable Unions of Sets in the Core Model
• scientific article; zbMATH DE number 3896909 (Why is no real title available?)
• Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
• A CLASS OF MODELS FOR SKALA'S SET THEORY
• Counting models of set theory
• Borel complexity and potential canonical Scott sentences
• Borel sets, countable models
• Every countable model of set theory embeds into its own constructible universe
• scientific article; zbMATH DE number 6304251 (Why is no real title available?)
• scientific article; zbMATH DE number 5033824 (Why is no real title available?)
• MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
• Countable structures \(\Sigma \)-definable over classical continuous number systems
• Complexity ranks of countable models

This page was built for publication: The classification of countable models of set theory

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