On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
DOI10.1016/J.APAL.2016.04.015zbMATH Open1417.03230OpenAlexW2343884603MaRDI QIDQ306575FDOQ306575
Authors: Cameron Donnay Hill
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
Recommendations
rosy theoriesalgorithmic meta-theoremscoordinatizationfinite structuresFraisse classeshierarchical decomposition
Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Pattern recognition and machine learning.
- Identifying independence in bayesian networks
- Title not available (Why is that?)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Computing with first-order logic
- A new strongly minimal set
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Rank-width and vertex-minors
- Graph minor theory
- A geometric introduction to forking and thorn-forking
- Characterizing rosy theories
- Properties and consequences of Thorn-independence
- On generic structures
- A simpler axiomatization of the Shelah-Spencer almost sure theories
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
- Thorn orthogonality and domination in unstable theories
- Finite satisfiability and ℵ0-categorical structures with trivial dependence
- Algorithmic Meta-theorems
- Super/rosy \(L^k\)-theories and classes of finite structures
Cited In (2)
Uses Software
This page was built for publication: On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306575)