Hypergraph sequences as a tool for saturation of ultrapowers
From MaRDI portal
Recommendations
- Constructing regular ultrafilters from a model-theoretic point of view
- Independence, order, and the interaction of ultrafilters and theories
- Saturating the random graph with an independent family of small range
- Keisler's order has infinitely many classes
- A dividing line within simple unstable theories
Cites work
- Classification theory and the number of non-isomorphic models.
- Edge distribution and density in the characteristic sequence
- scientific article; zbMATH DE number 524139 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- Lascar strong types in some simple theories
- Limits in the uniform ultrafilters
- More on \(\mathrm{SOP}_1\) and \(\mathrm{SOP}_2\)
- On \(\vartriangleleft^{*}\)-maximality.
- On uniform definability of types over finite sets
- Realization of -types and Keisler's order
- Simple unstable theories
- The characteristic sequence of a first-order formula
- Toward classifying unstable theories
- Ultrafilters and Independent Sets
- Ultraproducts in the theory of models
- Ultraproducts which are not saturated
Cited in
(23)- Keisler's order has infinitely many classes
- A new look at interpretability and saturation
- On Kim-independence
- Keisler's order is not simple (and simple theories may not be either)
- A dividing line within simple unstable theories
- Constructing regular ultrafilters from a model-theoretic point of view
- An example of a new simple theory
- Cofinality spectrum problems: the axiomatic approach
- Cofinality spectrum theorems in model theory, set theory, and general topology
- Theories without the tree property of the second kind
- Independence, order, and the interaction of ultrafilters and theories
- A separation theorem for simple theories
- General topology meets model theory, on 𝔭 and 𝔱
- Saturating the random graph with an independent family of small range
- Open problems on ultrafilters and some connections to the continuum
- Regularity lemmas for stable graphs
- On directed analogues of expander and hyperfinite graph sequences
- Using ultrapowers to compare continuous structures
- Some simple theories from a Boolean algebra point of view
- THE TURING DEGREES AND KEISLER’S ORDER
- Shearing in some simple rank one theories
- New simple theories from hypergraph sequences
- Existence of optimal ultrafilters and the fundamental complexity of simple theories
This page was built for publication: Hypergraph sequences as a tool for saturation of ultrapowers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388726)
