The classification of countable models of set theory
From MaRDI portal
Publication:5119907
DOI10.1002/malq.201900008OpenAlexW3105223877MaRDI QIDQ5119907
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite time decidable equivalence relation theory
- Intermediate submodels and generic extensions in set theory
- A Borel reductibility theory for classes of countable structures
- The Complexity of Classification Problems for Models of Arithmetic
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Models and types of Peano's arithmetic
- An absoluteness principle for Borel sets
- Infinite time Turing machines
- Counting models of set theory
- Model Theory
- Set Theory
This page was built for publication: The classification of countable models of set theory