SCAN is complete for all sahlqvist formulae

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3051, Issue , 2004, Pages 149-162

  Goranko, V ^a   Hustadt, U ^b   Schmidt, R A ^c   Vakarelov, D ^d  

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

^d UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

EXISTENTIAL SECOND-ORDER LOGIC; FIRST ORDER; FIRST ORDER LOGIC; FIRST-ORDER FORMULAS; MODAL LANGUAGE; SECOND-ORDER LOGIC;

COMPUTER CIRCUITS;

EID: 33747340784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24771-5_13     Document Type: Article

References (19)

1. W. Bibel and P. H. Schmitt, editors. Automated Deduction - A Basis for Applications, Vol. I-III. Kluwer, 1998.
2. P. Blackburn, M. de Rijke, and V. Venema. Modal Logic. Cambridge Univ. Press, 2001.
3. A. Chagrov and M. Zakharyaschev. Modal Logic, volume 35 of Oxford Logic Guides. Clarendon Press, Oxford, 1997.
4. M. de Rijke, and Y. Venema Sahlqvist's Theorem For Boolean Algebras with Operators with an Application to Cylindric Algebras, Studia Logica, 54:61-78, 1995.
5. P. Doherty, W. Lukaszewics, and A. Szalas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18(3):297-336, 1997.
6. T. Engel. Quantifier Elimination in Second-Order Predicate Logic. MSc thesis, Saarland University, Saarbrücken, Germany, 1996.
7. C.G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution decision procedures. In Handbook of Automated Reasoning, pp. 1791-1849. Elsevier, 2001.
8. D. M. Gabbay and H. J. Ohlbach. Quantifier elimination in second-order predicate logic. South African Computer Journal, 7:35-43, 1992.
9. V. Goranko and D. Vakarelov. Sahlqvist formulas unleashed in polyadic modal languages. In Advances in Modal Logic, vol. 3, pp. 221-240. World Scientific, 2002.
10. B. Jónsson. On the canonicity of Sahlqvist identities. Studia Logica, 53:473-491, 1994.
11. M. Kracht. How completeness and correspondence theory got married. In Diamonds and Defaults, pp. 175-214. Kluwer, 1993.
12. A. Nonnengart. Strong skolemization. Research Report MPI-I-96-2-010, Max-Planck-Institut für Informatik, Saarbrücken, 1996.
13. A. Nonnengart, H. J. Ohlbach, and A. Szalas. Quantifier elimination for second-order predicate logic. In Logic, Language and Reasoning: Essays in honour of Dov Gabbay. Kluwer, 1999.
14. A. Nonnengart and C. Weidenbach. Computing small clause normal forms. In Handbook of Automated Reasoning, pp. 335-367. Elsevier, 2001.
15. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science, 2001.
16. H. Sahlqvist. Completeness and correspondence in the first and second order semantics for modal logics. In Proc. of the 3rd Scandinavian Logic Symposium, 1973, pp. 110-143. North-Holland, 1975.
17. G. Sambin and V. Vaccaro. A new proof of Sahlqvist's theorem on modal definability and completeness. Journal of Symbolic Logic, 54(3):992-999, 1989.
18. A. Szalas. On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation, 3(6):605-620, 1993.
19. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, 1983.