THE TURING DEGREES AND KEISLER’S ORDER
From MaRDI portal
Publication:6203559
Cites work
- A primer of simple theories
- Classification theory and the number of non-isomorphic models.
- Cofinality spectrum theorems in model theory, set theory, and general topology
- Defining totality in the enumeration degrees
- Existence of optimal ultrafilters and the fundamental complexity of simple theories
- Hypergraph sequences as a tool for saturation of ultrapowers
- Keisler's order is not simple (and simple theories may not be either)
- Model theory.
- Simple unstable theories
- Some theorems of set theory and their topological consequences
- Turing computability. Theory and applications
- Ultraproducts which are not saturated
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)