Loosely guarded fragment of first-order logic has the finite model property

Studia Logica

Volumn 70, Issue 2, 2002, Pages 205-240

  Hodkinson, Ian ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Clique guarded fragment; Finite structures; Herwig theorem; Modal fragment; Modal logic; Packed fragment

Indexed keywords

EID: 52649092396     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1015178417181     Document Type: Article

References (31)

1. H. Andréka, I. Hodkinson, and I. Németi, 'Finite algebras of relations are representable on finite sets', J. Symbolic Logic 64 (1999), 243-267.
2. H. Andréka, J. van Benthem, and I. Németi, 'Modal logics and bounded fragments of predicate logic', J. Philosophical Logic 27 (1998), 217-274.
3. C. Areces, C. Monz, H. de Nivelle, and M. de Rijke, 'The guarded fragment: Ins and outs', in JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, J. Gerbrandy, M. Marx, M. de Rijke, and Y. Venema (eds.), Vossiuspers, Amsterdam University Press, Amsterdam, 1999, CD-ROM, ISBN 90 5629 104 1.
4. D. M. Gabbay, 'Expressive functional completeness in tense logic (preliminary report)', in Aspects of Philosophical Logic, U. Monnich (ed.), Reidel, Dordrecht, 1981, pp. 91-117.
5. E. Grädel, 'Decision procedures for guarded logics', in Automated Deduction - CADE16. Proceedings of 16th International Conference on Automated Deduction, Trento, 1999, LNCS, vol. 1632, Springer-Verlag, 1999, pp. 31-51.
6. _, 'On the restraining power of guards', J. Symbolic Logic 64 (1999), 1719-1742.
7. M. Grohe, 'Arity hierarchies', Ann. Pure Appl. Logic 82 (1996), 103-163.
8. B. Herwig, 'Extending partial isomorphisms on finite structures', Combinatorica 15 (1995), 365-371.
9. _, 'Extending partial isomorphisms for the small index property of many ω-categorical structures', Israel J. Math. 107 (1998), 93-124.
10. B. Herwig and D. Lascar, 'Extending partial isomorphisms and the profinite topology on the free groups', Trans. Amer. Math. Soc. 352 (2000), 1985-2021.
11. C. Hirsch and S. Tobies, 'A tableau algorithm for the clique guarded fragment', in Advances in Modal Logic 3, F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev (eds.), CSLI, 2001, to appear.
12. R. Hirsch and I. Hodkinson, 'Relation algebras from cylindric algebras, I', Ann. Pure Appl. Logic, 112 (2001) 225-266.
13. _, 'Relation algebras with n-dimensional relational bases', Ann. Pure Appl. Logic 101 (2000), 227-274.
14. _, 'Relation algebras by games', North-Holland, 2002, to appear.
15. R. Hirsch, I. Hodkinson, M. Marx, Sz. Mikulás, and M. Reynolds, 'Mosaics and step-by-step', in Logic at Work, E. Orłowska (ed.), Studies in Fuzziness and Soft Computing, vol. 24, Physica-Verlag, Heidelberg/New York, 1998, Appendix to A Modal Logic of Relations by Y. Venema and M. Marx, pp. 158-167.
16. I. Hodkinson, F. Wolter, and M. Zakharyaschev, 'Decidable fragments of first-order temporal logics', Ann. Pure Appl. Logic 106 (2000), 85-134.
17. E. Hrushovski, 'Extending partial isomorphisms of graphs', Combinatorica 12 (1992), 411-416.
18. J. A. W. Kamp, 'Tense logic and the theory of linear order', Ph.D. thesis, University of California, Los Angeles, 1968.
19. R. Maddux, 'Some varieties containing relation algebras', Trans. Amer. Math. Soc. 272 (1982), 501-526.
20. _, 'A sequent calculus for relation algebras', Ann. Pure Appl. Logic 25 (1983), 73-101.
21. M. Marx, 'Complexity of modal logics of relations', Tech. Report ML-1997-02, ILLC, University of Amsterdam, 1997. Available at http://www.wins.uva.nl/research/illc/Publications/ResearchReports/ML-1997-02. text.ps.gz
22. _, 'Tolerance logic', J. Logic, Language and Information 10 (2001), 353-373.
23. Sz. Mikulás and M. Marx, 'Undecidable relativizations of algebras of relations', J. Symbolic Logic 64 (1999), 747-760.
24. M. Reynolds, 'The complexity of the temporal logic over the reals', (1999), submitted. Available at http: //www.it .murdoch.edu.au/~mark/research/ online/cort. html
25. _, 'The complexity of the temporal logic with until over general linear time', Journal of Computer and System Sciences, accepted subject to some small revisions being made, 2002. Earlier draft version of manuscript available at http://www.it.murdoch.edu.au/ mark/research/online/cult.html
26. J. K. Truss, 'Generic automorphisms of homogeneous structures', Proc. London Math. Soc. 64 (1992), 121-141.
27. J. van Benthem, Modal correspondence theory, Ph.D. thesis, Mathematical Institute, University of Amsterdam, 1976.
28. _, Exploring logical dynamics, Studies in Logic, Language and Information, CSLI Publications & FoLLI, Stanford, 1996.
29. _, 'Dynamic bits and pieces', Technical Report LP-97-01, ILLC, University of Amsterdam, 1997. Available at http://preprint.beta.uva.nl/server/bp_search. show_doc?p_srvr_id=3&p_doc_id=468
30. _, Modal logic and classical logic, Bibliopolis, Naples, 1985.
31. M. Vardi, 'Why is modal logic so robustly decidable?', in Descriptive complexity and finite models, N. Immerman and Ph. Kolaitis (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, Amer. Math. Soc, Providence, RI, 1997, pp. 149-184.