Existential characterizations of monadic NIP
From MaRDI portal
Cites work
- A Guide to NIP Theories
- Around classification theory of models
- Characterizations of monadic NIP
- Classification theory and the number of non-isomorphic models.
- Decomposition horizons and a characterization of stable hereditary classes of graphs
- Hereditary and monotone properties of combinatorial structure
- scientific article; zbMATH DE number 6490941 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 7788458 (Why is no real title available?)
- Indiscernibles, EM-types, and Ramsey classes of trees
- Infinite Permutation Groups of Rapid Growth
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Jumps in speeds of hereditary properties in finite relational languages
- Monadic stability and growth rates of ω$\omega$‐categorical structures
- Mutually algebraic structures and expansions by predicates
- Overview of some general results in combinatorial enumeration
- Second-order quantifiers and the complexity of theories
- Simple monadic theories and partition width
- Simple theories and hyperimaginaries
- Sparsity. Graphs, structures, and algorithms
- Twin-width. IV: Ordered graphs and matrices
This page was built for publication: Existential characterizations of monadic NIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857555)
