Some simple theories from a Boolean algebra point of view
From MaRDI portal
Abstract: We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the theories , which are the higher-order analogues of the triangle-free random graph. The proof involves building Boolean algebras and ultrafilters "by hand" to satisfy certain model theoretically meaningful chain conditions. This may be seen as advancing a line of work going back through Kunen's construction of good ultrafilters in ZFC using families of independent functions. We conclude with a theorem on flexible ultrafilters, and open questions.
Cites work
- A dividing line within simple unstable theories
- A new look at interpretability and saturation
- A remark on density characters
- A separation theorem for simple theories
- An example of a new simple theory
- Classification theory and the number of non-isomorphic models.
- Cofinality spectrum problems: the axiomatic approach
- Cofinality spectrum theorems in model theory, set theory, and general topology
- Combinatorial set theory: Partition relations for cardinals
- Constructing regular ultrafilters from a model-theoretic point of view
- Existence of optimal ultrafilters and the fundamental complexity of simple theories
- Good and Ok Ultrafilters
- scientific article; zbMATH DE number 3115891 (Why is no real title available?)
- scientific article; zbMATH DE number 3467030 (Why is no real title available?)
- scientific article; zbMATH DE number 2220970 (Why is no real title available?)
- Hypergraph sequences as a tool for saturation of ultrapowers
- Keisler's order has infinitely many classes
- Keisler's order is not linear, assuming a supercompact
- Keisler's order is not simple (and simple theories may not be either)
- Limits in the uniform ultrafilters
- MODEL THEORY AND ULTRAPRODUCTS
- Model-theoretic properties of ultrafilters built by independent families of functions
- On families of large oscillation
- On the density of λ-box products
- Power problems in abstract spaces
- Realization of -types and Keisler's order
- Saturating the random graph with an independent family of small range
- Set mappings on 4-tuples
- Some theorems of set theory and their topological consequences
- Sur les opérations linéaires dans l'espace des fonctions bornées
- Séparabilité et multiplication cartésienne des espaces topologiques
- The ultraproduct construction
- Two consistency results on set mappings
- Ultrafilters and Independent Sets
- Ultraproducts which are not saturated
This page was built for publication: Some simple theories from a Boolean algebra point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073915)