Existence of optimal ultrafilters and the fundamental complexity of simple theories
From MaRDI portal
(Redirected from Publication:908076)
Abstract: In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable formula theorem was known. A contribution of the ultrapower characterization was that it involved sorting out the global theory, and introducing nonforking, seminal for the development of stability theory. Prior to the present paper, there had been no such characterization of an unstable class. In the present paper, we first establish the existence of so-called optimal ultrafilters on Boolean algebras, which are to simple theories as Keisler's good ultrafilters are to all theories. Then, assuming a supercompact cardinal, we characterize the simple theories in terms of saturation of ultrapowers. To do so, we lay the groundwork for analyzing the global structure of simple theories, in ZFC, via complexity of certain amalgamation patterns. This brings into focus a fundamental complexity in simple unstable theories having no real analogue in stability.
Recommendations
- SIMPLICITY IN COMPACT ABSTRACT THEORIES
- scientific article; zbMATH DE number 175742
- Complexity of the universal theory of modal algebras
- scientific article; zbMATH DE number 2015285
- scientific article; zbMATH DE number 3274717
- Independence, order, and the interaction of ultrafilters and theories
- scientific article; zbMATH DE number 1556962
- On the Theoretical and Practical Complexity of the Existential Theory of Reals
- scientific article; zbMATH DE number 8764
- scientific article; zbMATH DE number 1471994
Cites work
- scientific article; zbMATH DE number 3115891 (Why is no real title available?)
- scientific article; zbMATH DE number 3243872 (Why is no real title available?)
- scientific article; zbMATH DE number 3250588 (Why is no real title available?)
- scientific article; zbMATH DE number 2220970 (Why is no real title available?)
- scientific article; zbMATH DE number 3192066 (Why is no real title available?)
- A dividing line within simple unstable theories
- 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
- Constructing regular ultrafilters from a model-theoretic point of view
- Diophantine Problems Over Local Fields I
- Diophantine problems over local fields. III: Decidable fields
- Every two elementarily equivalent models have isomorphic ultrapowers
- General topology meets model theory, on 𝔭 and 𝔱
- Good and Ok Ultrafilters
- Good ideals in fields of sets
- Hypergraph sequences as a tool for saturation of ultrapowers
- Keisler's order has infinitely many classes
- Model theory and the cardinal numbers \(\mathfrak p\) and \(\mathfrak t\)
- Model-theoretic properties of ultrafilters built by independent families of functions
- Realization of \(\varphi \)-types and Keisler's order
- Reduced direct products
- Saturation of ultrapowers and Keisler's order
- Some theorems of set theory and their topological consequences
- Ultrafilters and Independent Sets
- Ultraproducts in the theory of models
- Ultraproducts which are not saturated
Cited in
(19)- Cichoń's maximum
- Model-theoretic applications of cofinality spectrum problems
- A dividing line within simple unstable theories
- A separation theorem for simple theories
- A new look at interpretability and saturation
- Keisler's order is not linear, assuming a supercompact
- Compact cardinals and eight values in Cichoń's diagram
- Keisler's order is not simple (and simple theories may not be either)
- Cofinality spectrum theorems in model theory, set theory, and general topology
- Using ultrapowers to compare continuous structures
- Atomic saturation of reduced powers
- An example of a new simple theory
- Some simple theories from a Boolean algebra point of view
- Cofinality spectrum problems: the axiomatic approach
- THE TURING DEGREES AND KEISLER’S ORDER
- The Keisler order in continuous logic
- On positive local combinatorial dividing-lines in model theory
- Keisler's order has infinitely many classes
- Open problems on ultrafilters and some connections to the continuum
This page was built for publication: Existence of optimal ultrafilters and the fundamental complexity of simple theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908076)
