Repairing the interpolation theorem in quantified modal logic

Annals of Pure and Applied Logic

Volumn 124, Issue 1-3, 2003, Pages 287-299

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

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b INRIA   (France)

Author keywords

Beth definability; Bounded fragment; Interpolation; Quantified hybrid logic; Quantified modal logic

Indexed keywords

EID: 0142231840     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(03)00059-9     Document Type: Article

References (12)

1. Areces C. Blackburn P. Marx M. Hybrid logics: characterization, interpolation and complexity J. Symbolic Logic 66 3 2001 977-1010
2. Blackburn P. de Rijke M. Venema Y. Modal Logic 2001 Cambridge University Press Cambridge
3. Blackburn P. Seligman J. Hybrid languages J. Logic, Language Inform. 4 3 1995 251-272
4. Chang C. Keisler H. Model Theory 1973 North-Holland Amsterdam
5. Fine K. Failures of the interpolation lemma in quantified modal logic J. Symbolic Logic 44 2 1979 201-206
6. Fitting M. Interpolation for first-order S5 J. Symbolic Logic 67 2002 621-634
7. Fitting M. Mendelsohn R. First-Order Modal Logic 1998 Kluwer Academic Publishers Dordrecht
8. Goranko V. Hierarchies of modal and temporal logics with reference pointers J. Logic Language Inform. 5 1 1996 1-24
9. Passy S. Tinchev T. An essay in combinatory dynamic logic Inform. and Comput. 93 2 1991 263-332
10. Prior A. Past, Present and Future 1967 Oxford University Press Oxford
11. van Benthem J. Modal Logic and Classical Logic 1983 Bibliopolis Naples
12. M. Vardi, Why is modal logic so robustly decidable? in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, American Mathematical Society, Providence, RI, 1997, pp. 149-184.