Hybrid logics: Characterization, interpolation and complexity

Journal of Symbolic Logic

Volumn 66, Issue 3, 2001, Pages 977-1010

  Areces, Carlos ^a   Blackburn, Patrick ^b   Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035647293     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695090     Document Type: Article

References (38)

1. C. ARECES, P. BLACKBURN, and M. MARX, A roadmap of the complexity of hybrid logics, Computer science logic (J. Flum and M. Rodríguez-Artalejo, editors), LNCS, no. 1683, Springer, 1999, Proceedings of the 8th Annual Conference of the EACSL, Madrid, September 1999, pp. 307-321.
2. _, The computational complexity of hybrid temporal logics, Logic Journal of the IGPL, vol. 8 (2000), no. 5, pp. 653-679.
3. E. BETH, On Padoa's method in the theory of definition, Nederl. Akad. Wetensch. Proc. Ser. A. 56 = Indagationes Math., vol. 15 (1953), pp. 330-339.
4. P. BLACKBURN, Nominal tense logic, Notre Dame Journal of Formal Logic, vol. 34 (1993), no. 1, pp. 56-83.
5. _, Internalizing labelled deduction, Journal of Logic and Computation, vol. 10 (2000), no. 1, pp. 136-168.
6. P. BLACKBURN and J. SELIGMAN, Hybrid languages, Journal of Logic, Language and Information, vol. 4 (1995), no. 3, pp. 251-272, Special issue on decompositions of first-order logic.
7. _, What are hybrid languages?, Advances in modal logic (M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors), vol. 1, CSLI Publications, Stanford University, 1998, pp. 41-62.
8. P. BLACKBURN and M. TZAKOVA, Hybrid completeness, Logic Journal of the IGPL, vol. 6 (1998), no. 4, pp. 625-650.
9. _, Hybrid languages and temporal logics (full version), Technical Report CLAUS-Report 96, Computerlinguistik, Universität des Saarlandes, 1998, http://www.coli.uni-sb.de/cl/claus.
10. _, Hybrid languages and temporal logics, Logic Journal of the IGPL, vol. 7 (1999), no. 1, pp. 27-54.
11. R. BULL, An approach to tense logic, Theoria, vol. 36 (1970), pp. 282-300.
12. C. CHANG and H. KEISLER, Model theory, third ed., Studies in Logic and the Foundations of Mathematics, vol. 73, North-Holland Publishing Co, Amsterdam, 1990.
13. B. COMRIE, Tense, Cambridge University Press, 1985.
14. W. CRAIG, Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory, this JOURNAL, vol. 22 (1957), pp. 269-285.
15. J. CZELAKOWSKI, Logical matrices and the amalgamation property, Studia Logica, vol. XLI (1982), no. 4, pp. 329-341.
16. G. DE GIACOMO, Decidability of class-based knowledge representation formalisms, Ph.D. thesis, Università di Roma "La Sapienza", 1995.
17. H. ENDERTON, A mathematical introduction to logic, Academic Press, New York, 1972.
18. G. GARGOV and V. GORANKO, Modal logic with names, Journal of Philosophical Logic, vol. 22 (1993), no. 6, pp. 607-636.
19. V. GORANKO, Hierarchies of modal and temporal logics with reference pointers, Journal of Logic, Language and Information, vol. 5 (1996), no. 1, pp. 1-24.
20. J. HALPERN and Y. MOSES, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence, vol. 54 (1992), pp. 319-379.
21. W. HODGES, Model theory, Cambridge University Press, Cambridge, 1993.
22. R. LADNER, The computational complexity of provability in systems of modal propositional logic, SIAM Journal of Computing, vol. 6 (1977), no. 3, pp. 467-480.
23. L. MAKSIMOVA, Amalgamation and interpolation in normal modal logics, Studio Logica, vol. L (1991), no. 3/4, pp. 457-471.
24. M. MARX and Y. VENEMA, Multi-dimensional modal logic, Applied Logic Series, Kluwer Academic Publishers, 1997.
25. C. PAPADIMITRIOU, Computational complexity, Addison-Wesley, 1994.
26. S. PASSY and T. TINCHEV, Quantifiers in combinatory PDL: completeness, definability, incompleteness, Fundamentals of computation theory (Cottbus, 1985), Springer, Berlin, 1985, pp. 512-519.
27. _, An essay in combinatory dynamic logic, Information and Computation, vol. 93 (1991), no. 2, pp. 263-332.
28. A. PRIOR, Past, present and future, Clarendon Press, Oxford, 1967.
29. H. REICHENBACH, Elements of symbolic logic, Random House, New York, 1947.
30. J. SELIGMAN, A cut-free sequent calculus for elementary situated reasoning, Technical Report HCRC/RP-22, HCRC, Edinburgh, 1991.
31. _, The logic of correct description, Advances in intensional logic (M. de Rijke, editor), Kluwer, 1997, pp. 107-135.
32. E. SPAAN, Complexity of modal logics, Ph.D. thesis, ILLC. University of Amsterdam, 1993.
33. E. SPAAN, The complexity of propositional tense logics, Diamonds and defaults (Amsterdam, 1990/1991), Kluwer Acad. Publ., Dordrecht, 1993, pp. 287-307.
34. M. TZAKOVA, Tableaux calculi for hybrid logics., Conference on tableaux calculi and related methods (TABLEAUX), Saratoga Springs, USA (N. Murray, editor), LNAI, vol. 1617, Springer Verlag, 1999, pp. 278-292.
35. J. VAN BENTHEM, Modal logic and classical logic, Bibliopolis, Naples, 1983.
36. _, Exploring logical dynamics, Studies in Logic, Language and Information, CSLI Publications, Stanford, 1996.
37. Y. VENEMA, A modal logic for quantification and substitution, Bulletin of the IGPL, vol. 2 (1994), no. 1, pp. 31-45.
38. A. WOODS, Some problems in logic and number theory, and their connections, Ph.D. thesis, University of Manchester, 1981.