Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures
DOI10.2178/bsl/1058448678zbMath1058.03031OpenAlexW2165966638MaRDI QIDQ4650305
Publication date: 9 February 2005
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bsl/1058448678
finite model propertyconformal covers for finite hypergraphsextension property for partial isomorphismsfinite model theory of relational structuresGaifman cliquesguarded logics
Hypergraphs (05C65) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Model theory of finite structures (03C13)
Related Items (13)
Cites Work
- Extending partial isomorphisms of graphs
- Modal languages and bounded fragments of predicate logic
- Extending partial isomorphisms for the small index property of many \(\omega\)-categorical structures
- Loosely guarded fragment of first-order logic has the finite model property
- Extending partial isomorphisms on finite structures
- On the Desirability of Acyclic Database Schemes
- Extending partial automorphisms and the profinite topology on free groups
- On the Restraining Power of Guards
- Tolerance logic
This page was built for publication: Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures