Elementary canonical formulae: extending Sahlqvist's theorem

Annals of Pure and Applied Logic

Volumn 141, Issue 1-2, 2006, Pages 180-217

  Goranko, Valentin ^a   Vakarelov, Dimiter ^b  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

^b UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

Elementary canonical formulae; First order definability; Modal logic; Nominals; Persistence; Polyadic modal languages; Pure formulae; Reversive languages; Sahlqvist formulae

Indexed keywords

EID: 33747368729     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.10.005     Document Type: Article

References (50)

1. Arnold A., and Niwinski D. Rudiments of μ-calculus. Studies in Logic and the Foundations of Mathematics vol. 146 (2001), Elsevier
2. Blackburn P., de Rijke M., and Venema Y. Modal Logic. Cambridge Tracts in Theoretical Computer Science (2001), Cambridge University Press
3. Boolos G., and Sambin G. An incomplete system of modal logic. Journal of Philosophical Logic 14 (1985) 351-358
4. Chagrov A., and Zakharyaschev M. Modal Logic (1997), Clarendon Press, Oxford
5. Chagrov A., and Zakharyaschev M. Sahlqvist formulae are not so elementary. In: Csirmaz L., Gabbay D., and de Rijke M. (Eds). Logic Colloquium'92 (1995), CSLI Publications, Stanford 61-73
6. Conradie W., Goranko V., and Vakarelov D. Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model-Theoretic Aspects. In: Schmidt R., et al. (Ed). Advances in Modal Logic vol. 5 (2005), Kings College, London 17-51
7. W. Conradie, V. Goranko, D. Vakarelov, Algorithmic correspondence and completeness in modal logic. I. The Algorithm SQEMA, 2005 (submitted for publication)
8. W. Conradie, V. Goranko, D. Vakarelov, Algorithmic correspondence and completeness in modal logic. II. Extensions of the Algorithm SQEMA, 2006 (in preparation)
9. W. Conradie, V. Goranko, Algorithmic classes of elementary canonical formulae, 2006 (in preparation)
10. W. Conradie, V. Goranko, Model-theoretic and algebraic perspectives on elementary canonical formulae, 2006 (in preparation)
11. M. de Rijke, How not to generalize Sahlqvist's Theorem, Technical Note, ILLC, 1992
12. M. de Rijke, Extending Modal Logic, Ph.D. Thesis, ILLC, University of Amsterdam, ILLC Dissertation Series 1993-4, 1993
13. de Rijke M., and Venema Y. Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras. Studia Logica 54 (1995) 61-78
14. Doherty P., Lukaszewics W., and Szalas A. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning 18 3 (1997) 297-336
15. Ebbinghaus H.-D., and Flum J. Finite Model Theory (1995), Springer
16. Gabbay D., Hodkinson I., and Reynolds M. Temporal Logic: Mathematical Foundations and Computational Aspects vol. 1 (1994), Clarendon Press, Oxford
17. Gabbay D., and Ohlbach H.-J. Quantifier elimination in second-order predicate logic. South African Computer Journal 7 (1992) 35-43
18. Gargov G., and Goranko V. Modal logic with names. Journal of Philosophical Logic 22 6 (1993) 607-636
19. Gehrke M., and Jónsson B. Bounded distributive lattices with operators. Mathematica Japonica 40 (1994) 207-215
20. Gehrke M., and Jónsson B. Bounded distributive lattice extensions. Mathematica Scandinavica 94 2 (2004) 13-45
21. Gehrke M., Nagahashi H., and Venema Y. A Sahlqvist theorem for distributive modal logic. Annals of Pure and Applied Logic 131 1-3 (2005) 65-102
22. Ghilardi S., and Meloni G. Constructive canonicity in non-classical logics. Annals of Pure and Applied Logic 86 (1997) 1-32
23. Goldblatt R. First-order definability in modal logic. Journal of Symbolic Logic 40 (1975) 35-40
24. Goldblatt R. Varieties of complex algebras. Annals of Pure and Applied Logic 44 (1989) 173-242
25. Goldblatt R. Persistence and atomicity for varieties of Boolean algebras with operators. Studia Logica (2001) 155-171
26. Goldblatt R., Hodkinson I., and Venema Y. Erdos graphs resolve Fine's canonicity problem. Bullettin of Symbolic Logic 10 2 (2004) 186-208
27. Goranko V., and Vakarelov D. Sahlqvist formulae in Hybrid Polyadic Modal Languages. Journal of Logic and Computation 11 5 (2001) 737-754
28. Goranko V., and Vakarelov D. Sahlqvist Formulae Unleashed in Polyadic Modal Languages. Advances in Modal Logic vol. 3 (2002), World Scientific, Singapore 221-240
29. Goranko V., Hustadt U., Schmidt R., and Vakarelov D. SCAN is complete for all Sahlqvist formulae. Relational and Kleene-Algebraic Methods in Computer Science (Proc. of RelMiCS 7). LNCS vol. 3051 (2004), Springer 149-162
30. Jónsson B. On the canonicity of Sahlqvist identities. Studia Logica 53 (1995) 473-491
31. Jónsson B., and Tarski A. Boolean Algebras with Operators, Part 1. American Journal of Mathematics 73 (1952) 891-939
32. Kracht M. How completeness and correspondence theory got married. In: de Rijke M. (Ed). Diamonds and Defaults (1993), Kluwer, Synthese Library 175-214
33. Kracht M. Tools and Techniques in Modal Logic (1999), Elsevier, Amsterdam
34. Kracht M., and Wolter F. Simulation and transfer results in modal logic - A survey. Studia Logica 59 (1997) 149-177
35. Nonnengart A., and Szalas A. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In: Orlowska E. (Ed). Logic at Work, Essays Dedicated to the Memory of Helena Rasiowa (1998), Springer Physica-Verlag 89-108
36. Nonnengart A., Ohlbach H.J., and Szalas A. Quantifier elimination for second-order predicate logic. In: Ohlbach H.J., and Reyle U. (Eds). Logic, Language and Reasoning: Essays in Honour of Dov Gabbay, Part I (1997), Kluwer
37. Sahlqvist H. Correspondence and completeness in the first and second-order semantics for modal logic. In: Kanger S. (Ed). Proc. of the 3rd Scandinavial Logic Symposium. Uppsala 1973 (1975), North-Holland, Amsterdam 110-143
38. Sambin G., and Vaccaro V. Topology and duality in modal logic. Annals of Pure and Applied Logic 37 (1988) 249-296
39. Sambin G., and Vaccaro V. A new proof of Sahlqvist's theorem on modal definability and completeness. Journal of Symbolic Logic 54 (1989) 992-999
40. Szalas A. Second-order quantifier elimination in modal contexts. In: Flesca S., and Ianni G. (Eds). JELIA'02. LNAI vol. 2424 (2002), Springer-Verlag 223-232
41. Vakarelov D. Inductive modal logics. Fundamenta Informaticae 16 (1992) 383-405
42. Vakarelov D. In: Balbiani Ph., et al. (Ed). Modal Definability in Languages with a Finite Number of Propositional Variables and a New extension of the Sahlqvist's Class. Advances in Modal logic vol. 4 (2003), Kings Colledge Publications 499-518
43. Vakarelov D. Modal definability, solving equations in modal algebras and generalizations of the Ackermann lemma. In: Dimtracopoulos C. (Ed). Proceedings of the 5th Panhellenic Logic Symposium. July 25-28 (2005), University of Athens, Athens, Greece 182-189
44. Vakarelov D. On a generalizations of the Ackermann lemma for computing first-order equivalents of modal formulas. Logic Colloquium 2005, ASL European Summer Meeting. July 28-August 3, Athens, Greece, Abstracts (2005), Department of Mathematics, University of Athens, Athens, Greece 123. http://www.math.uoa.gr/lc2005 URL:
45. J.F.A.K. van Benthem, Modal Correspondence Theory, Ph. D. Dissertation, Mathematisch Instituut & Instituut voor Grondslagenonderzoek, University of Amsterdam, 1976
46. van Benthem J.F.A.K. Modal Logic and Classical Logic (1985), Bibleapolis, Napoli
47. Venema Y. Derivation rules as anti-axioms in modal logic. Journal of Symbolic Logic 58 (1993) 1003-1034
48. Venema Y. Atom structures and Sahlqvist equations. Algebra Universalis 38 (1997) 185-199
49. Venema Y. In: Kracht M., de Rijke M., Wansing H., and Zakharyaschev M. (Eds). Atom structures. Advances in Modal Logic vol. 1 (1998), CSLI Publications, Stanford 291-305
50. Venema Y. Canonical pseudo-correspondence. In: Kracht M., de Rijke M., Wansing H., and Zakharyaschev M. (Eds). Advances in Modal Logic vol. 2 (2000), CSLI Publications, Stanford also available as an ILLC preprint ML-1998-13 of the University of Amsterdam