THE TURING DEGREES AND KEISLER’S ORDER

DOI10.1017/JSL.2022.63MaRDI QIDQ6203559

Maryanthe Malliaris, Saharon Shelah

Publication date: 5 April 2024

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

classification theoryregular ultrapowersTuring degreesKeisler's order

Mathematics Subject Classification ID

Ultraproducts and related constructions (03C20) Other Turing degree structures (03D28)

Cites Work

• Existence of optimal ultrafilters and the fundamental complexity of simple theories
• Classification theory and the number of non-isomorphic models.
• Model theory.
• A primer of simple theories
• Keisler's order is not simple (and simple theories may not be either)
• Turing Computability
• Cofinality spectrum theorems in model theory, set theory, and general topology
• Simple unstable theories
• Hypergraph sequences as a tool for saturation of ultrapowers
• Some theorems of set theory and their topological consequences
• Ultraproducts which are not saturated
• Defining totality in the enumeration degrees

This page was built for publication: THE TURING DEGREES AND KEISLER’S ORDER