Transfer results for hybrid logic. Part I: The case without satisfaction operators

Journal of Logic and Computation

Volumn 16, Issue 2, 2006, Pages 177-197

  Bezhanishvili, Nick ^a   Cate, Balder Ten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Hybrid logic; Modal logic; Nominals; Transfer

Indexed keywords

COMPUTABILITY AND DECIDABILITY; INFORMATION ANALYSIS; INTERPOLATION; LARGE SCALE SYSTEMS; TECHNOLOGY TRANSFER;

HYBRID LOGIC; MODAL LOGIC; NOMINALS; TRANSFER;

FORMAL LOGIC;

EID: 33645734743     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exi056     Document Type: Article

References (29)

1. C. Areces, P. Blackburn and M. Marx. Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic, 66, 977-1010, 2001.
2. P. Blackburn. Nominal tense logic. Notre Dame Journal of Formal Logic, 34, 56-83, 1993.
3. P. Blackburn. Internalizing labelled deduction. Journal of Logic and Computation, 10, 137-168, 2000.
4. P. Blackburn, M. de Rijke and Y. Venema. Modal Logic. Cambridge University Press, Cambridge, 2001.
5. P. Blackburn and J. Seligman. Hybrid languages. Journal of Logic, Languages and Information, 4, 251-272, 1995.
6. G. Boolos. The Logic of Provability. Cambridge University Press, 1993.
7. B. ten Cate. Interpolation for extended modal languages. Journal of Symbolic Logic, 70, 223-234, 2005.
8. B. ten Cate. Model Theory for Extended Modal Languages. PhD thesis, University of Amsterdam, 2005. ILLC Dissertation Series DS-2005-01.
9. B. ten Cate, M. Marx and P. Viana. Hybrid logics with Sahlqvist axioms. Logic Journal of the IGPL, 13, 293-300, 2005.
10. A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford University Press, 1997.
11. C.-C. Chen and I.-P. Lin. The complexity of propositional modal theories and the complexity of consistency of prepositional modal theories. In Proceedings of the Third International Symposium on Logical Foundations of Computer Science, A. Nerode and Y. Matiyasevich, eds, volume 813 of Lecture Notes in Computer Science. Springer, 1994.
12. G. De Giacomo. Decidability of Class-Based Knowledge Representation Formalisms. PhD thesis, Università di Roma "La Sapienza", 1995.
13. M. J. Fisher and R. E. Ladner. Propositional modal logic of programs. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pp. 286-294, 1977.
14. D. Gabbay, Á. Kurucz, F. Wolter and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications, volume 148 of Studies in Logic. North-Holland, 2003.
15. G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22, 607-636, 1993.
16. S. Ghilardi and L. Santocanale. Algebraic and model-theoretic techniques for fusion decidability in modal logic. In Logic for Programming, Artificial Intelligence and Reasoning (LPAR 03), M. Vardi and A. Voronkov, eds. Volume 2850 of Lecture Notes in Artificial Intelligence, pp. 152-166. Springer Verlag, 2003.
17. S. Ghilardi and M. Zawadowski. Sheaves, Games and Model Completions. Trends in logic. Kluwer Academic, 2002.
18. B. Jónsson. Algebras whose congruence lattices are distributive. Mathematica Scandinavica, 21, 110-121, 1967.
19. M. Kracht and F. Wolter. Simulation and transfer results in modal logic - a survey. Studia Logica, 59, 149-177, 1997.
20. O. Kutz, F. Wolter, H. Sturm, N.-Y. Suzuki and M. Zakharyaschev. Logics of metric spaces. ACM Transactions on Computational Logic, 4, 260-294, 2003.
21. O. Kutz, C. Lutz, F. Wolter and M. Zakharyaschev. E-connections of abstract description systems. Artificial Intelligence, 156, 1-73, 2004.
22. D. Lewis. Intensional logics without iterative axioms. Journal of Philosophical Logic, 3, 457-466, 1974.
23. C. Lutz. An improved NEXPTTME-hardness result for the description logic ALC extended with inverse roles, nominals, and counting. LTCS-Report LTCS-04-07, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/ research/reports.html.
24. S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and computation, 93, 263-332, 1991.
25. A. Schaerf. Reasoning with individuals in concept languages. Data and Knowledge. Engineering, 13, 141-176, 1994.
26. E. Spaan. Complexity of Modal Logics. PhD thesis, ILLC, University of Amsterdam, 1993.
27. S. K. Thomason. Reduction of tense logic to modal logic ii. Theoria, 41, 154-169, 1975.
28. S. Tobies. The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. Journal of Artificial Intelligence Research, 12, 199-217, 2000.
29. A. Visser. Uniform interpolation and layered bisimulation. In Gödel 1996, volume 6 of Lecture Notes Logic, pp. 139-164. Springer, Berlin, 1996.