THE TURING DEGREES AND KEISLER’S ORDER

DOI10.1017/JSL.2022.63MaRDI QIDQ6203559FDOQ6203559

Authors: M. Malliaris, S. Shelah 

Publication date: 5 April 2024

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

zbMATH Keywords

classification theoryregular ultrapowersTuring degreesKeisler's order

Mathematics Subject Classification ID

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

Cites Work

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

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

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