On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae

Logic Journal of the IGPL (forthcoming)
  Copy   BIBTEX

Abstract

We elaborate on semantically labelled syntax trees that provide a method of proving the non-existence of modal formulae satisfying certain syntactic properties and defining a given class of frames and use them to show that there are classes of Kripke frames that are definable by both non-Sahlqvist and Sahlqvist formulae, but the latter requires more propositional variables.

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzac044

Links

PhilArchive



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

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

Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240.
Elementary canonical formulae: extending Sahlqvist’s theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
On the strength and scope of DLS.Willem Conradie - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):279-296.
A tableau calculus with automaton-labelled formulae for regular grammar logics.Rajeev Gore - unknown
Is Syntax Semantically Constrained? Evidence From a Grammaticality Judgment Study of Indonesian.I. Nyoman Aryawibawa & Ben Ambridge - 2018 - Cognitive Science 42 (8):3135-3148.
An extension of Kracht's theorem to generalized Sahlqvist formulas.Stanislav Kikot - 2009 - Journal of Applied Non-Classical Logics 19 (2):227-251.
Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240.
Semantic pollution and syntactic purity.Stephen Read - 2015 - Review of Symbolic Logic 8 (4):649-661.
On Sahlqvist Formulas in Relevant Logic.Guillermo Badia - 2018 - Journal of Philosophical Logic 47 (4):673-691.
Relevance via decomposition.David Makinson - 2017 - Australasian Journal of Logic 14 (3).
A Sahlqvist theorem for relevant modal logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
A Sahlqvist Theorem for Relevant Modal Logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
Approximate formulae for a logic that capture classes of computational complexity.Argimiro Arratia & Carlos Ortiz - 2008 - Logic Journal of the IGPL 17 (1):131-154.
A Sahlqvist theorem for substructural logic.Tomoyuki Suzuki - 2013 - Review of Symbolic Logic 6 (2):229-253.
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.

Analytics

Added to PP
2022-04-29

Downloads
11 (#1,136,567)

6 months
8 (#359,856)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.

View all 8 references / Add more references