An extension of Kracht's theorem to generalized Sahlqvist formulas

Journal of Applied Non-Classical Logics 19 (2):227-251 (2009)
  Copy   BIBTEX

Abstract

Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are important because of their first-order definability and canonicity, and hence axiomatize complete modal logics. The first-order properties definable by Sahlqvist formulas were syntactically characterized by Marcus Kracht in 1993. The present paper extends Kracht's theorem to the class of ‘generalized Sahlqvist formulas' introduced by Goranko and Vakarelov and describes an appropriate generalization of Kracht formulas.

Categories

Keywords

Reprint years

DOI

10.3166/jancl.19.227-251

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Sahlqvist theorem for relevant modal logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
Sahlqvist Correspondence for Modal mu-calculus.Johan Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
A Sahlqvist theorem for substructural logic.Tomoyuki Suzuki - 2013 - Review of Symbolic Logic 6 (2):229-253.
Natural language, sortal reducibility and generalized quantifiers.Edward L. Keenan - 1993 - Journal of Symbolic Logic 58 (1):314-325.
The γ-admissibility of Relevant Modal Logics II — The Method using Metavaluations.Takahiro Seki - 2011 - Studia Logica 97 (3):351-383.
One Connection between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers.Dorit Ben Shalom - 2003 - Journal of Logic, Language and Information 12 (1):47-52.
An Infinitary Extension of Jankov’s Theorem.Yoshihito Tanaka - 2007 - Studia Logica 86 (1):111 - 131.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
The translation theorem.Peter Cholak - 1994 - Archive for Mathematical Logic 33 (2):87-108.
Tait's conservative extension theorem revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Coinductive formulas and a many-sorted interpolation theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
Sahlqvist's Theorem for Boolean Algebras with Operators with an Application to Cylindric Algebras.Maarten De Rijke & Yde Venema - 1995 - Studia Logica 54 (1):61 - 78.
A double arity hierarchy theorem for transitive closure logic.Martin Grohe & Lauri Hella - 1996 - Archive for Mathematical Logic 35 (3):157-171.

Analytics

Added to PP
2013-12-25

Downloads
52 (#299,806)

6 months
22 (#118,559)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.

Add more citations

References found in this work

Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
Many-dimensional modal logics: theory and applications.Dov M. Gabbay (ed.) - 2003 - Boston: Elsevier North Holland.
On axiomatising products of Kripke frames.Ágnes Kurucz - 2000 - Journal of Symbolic Logic 65 (2):923-945.

View all 19 references / Add more references