The characteristic sequence of a first-order formula

DOI10.2178/jsl/1286198155zbMath1220.03019OpenAlexW2104974344MaRDI QIDQ3066802

Maryanthe Malliaris

Publication date: 12 January 2011

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

Full work available at URL: https://doi.org/10.2178/jsl/1286198155

zbMATH Keywords

simplicityNIPclassification theorycombinatorial configurationsfirst-order formulatree propertiescharacteristic sequence of hypergraphs

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45)

Related Items (8)

Cofinality spectrum problems: the axiomatic approach ⋮ Edge distribution and density in the characteristic sequence ⋮ Independence, order, and the interaction of ultrafilters and theories ⋮ A dividing line within simple unstable theories ⋮ Hypergraph sequences as a tool for saturation of ultrapowers ⋮ Keisler's order is not simple (and simple theories may not be either) ⋮ Regularity lemmas for stable graphs ⋮ Characterizing model-theoretic dividing lines via collapse of generalized indiscernibles

Cites Work

• More on \(\mathrm{SOP}_1\) and \(\mathrm{SOP}_2\)
• Realization of \(\varphi \)-types and Keisler's order
• On \(\vartriangleleft^{*}\)-maximality.
• Toward classifying unstable theories
• On generically stable types in dependent theories
• Lascar strong types in some simple theories
• From Stability to Simplicity

This page was built for publication: The characteristic sequence of a first-order formula