The characteristic sequence of a first-order formula

DOI10.2178/JSL/1286198155MaRDI QIDQ3066802zbMATH OpenOpenAlexFDO

Authors M. Malliaris

Publication date 12 January 2011

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

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

zbMATH Keywords

simplicityclassification theoryNIPcombinatorial configurationsfirst-order formulatree propertiescharacteristic sequence of hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• Edge distribution and density in the characteristic sequence
• Characterization of NIP theories by ordered graph-indiscernibles
• scientific article; zbMATH DE number 2113455
• A note on \(\mathrm{NSOP}_1\) in one variable
• Local order property in nonelementary classes

Cites work

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

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066802)