Skip to main content

Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures

  • Ian Hodkinson (a1) and Martin Otto (a2)

We provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques—thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. In terms of relational structures, we show that every finite relational structure admits a guarded bisimilar cover by a finite structure whose Gaifman cliques are guarded. One of our applications answers an open question about a clique constrained strengthening of the extension property for partial automorphisms (EPPA) of Hrushovski, Herwig and Lascar. A second application provides an alternative proof of the finite model property (FMP) for the clique guarded fragment of first-order logic CGF, by reducing (finite) satisfiability in CGF to (finite) satisfiability in the guarded fragment, GF.

Hide All
[1] Andréka, Hajnal, van Benthem, Johan, and Németi, Istvan, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, vol. 27 (1998), pp. 217274.
[2] Beeri, Catriel, Fagin, Ronald, Maier, David, and Yannakakis, Mihalis, On the desirability of acyclic database schemes, Journal of the Association for Computing Machinery, vol. 30 (1983), pp. 479513.
[3] Berge, Claude, Graphs and hypergraphs, North-Holland, 1973.
[4] Diestel, Reinhard, Graph theory, 2nd ed., Springer-Verlag, 2000.
[5] Ebbinghaus, Heinz-Dieter and Flum, Jörg, Finite model theory, Springer-Verlag, 1995.
[6] Gottlob, Georg, Leone, Nicola, and Scarcello, Francesco, The complexity of acyclic conjunctive queries, Journal of the Association for Computing Machinery, vol. 43 (2001), pp. 431498.
[7] Grädel, Erich, The decidability of guarded fixed point logic, JFAK. Essays dedicated to Johan van Benthem on the occasion of his 50th birthday (Gerbrandy, J., Marx, M., de Rijke, M., and Venema, Y., editors), CD-ROM, Amsterdam University Press, 1999.
[8] Grädel, Erich, Decision procedures for guarded logics, Proceedings of 16th international conference on automated deduction, CADE 16, 1999, Lecture Notes in Computer Science, vol. 1632, Springer-Verlag, 1999, pp. 3151.
[9] Grädel, Erich, On the restraining power of guards, The Journal of Symbolic Logic, vol. 64 (1999), pp. 17191742.
[10] Grädel, Erich, Hirsch, Colin, and Otto, Martin, Back and forth between guarded and modal logics, Association for Computing Machinery Transactions on Computational Logic, vol. 3 (2002), pp. 418463.
[11] Herwig, Bernhard, Extending partial isomorphisms on finite structures, Combinatorica, vol. 15 (1995), pp. 365371.
[12] Herwig, Bernhard, Extending partial isomorphisms for the small index property of many (omega)-categorical structures, Israel Journal of Mathematics, vol. 107 (1998), pp. 93124.
[13] Herwig, Bernhard and Lascar, Daniel, Extending partial isomorphisms and the profinite topology on free groups, Transactions of the AmericanMathematical Society, vol. 352 (2000), pp. 19852021.
[14] Hodkinson, Ian, Loosely guarded fragment of first-order logic has the finite model property, Studia Logica, vol. 70 (2002), pp. 205240.
[15] Hrushovski, Ehud, Extending partial isomorphisms of graphs, Combinatorica, vol. 12 (1992), pp. 411416.
[16] Marx, Maarten, Tolerance logic, Journal of Logic, Language and Information, vol. 10 (2001), pp. 353374.
[17] van Benthem, Johan, Dynamic bits and pieces, Technical Report LP-97-01, ILLC, Universiteit van Amsterdam, 1997.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed