On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
DOI10.1016/j.apal.2016.04.015zbMath1417.03230OpenAlexW2343884603MaRDI QIDQ306575
Publication date: 31 August 2016
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2016.04.015
coordinatizationalgorithmic meta-theoremsrosy theoriesfinite structuresFraisse classeshierarchical decomposition
Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
- Super/rosy \(L^k\)-theories and classes of finite structures
- A new strongly minimal set
- On generic structures
- Computing with first-order logic
- Interpreting nowhere dense graph classes as a classical notion of model theory
- A simpler axiomatization of the Shelah-Spencer almost sure theories
- Rank-width and vertex-minors
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Thorn orthogonality and domination in unstable theories
- Graph minor theory
- Finite satisfiability and ℵ0-categorical structures with trivial dependence
- Algorithmic Meta-theorems
- A GEOMETRIC INTRODUCTION TO FORKING AND THORN-FORKING
- Identifying independence in bayesian networks
- Characterizing rosy theories
- Properties and consequences of Thorn-independence
This page was built for publication: On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry