On the strength and scope of DLS

Journal of Applied Non-Classical Logics 16 (3-4):279-296 (2006)
  Copy   BIBTEX

Abstract

We provide syntactic necessary and sufficient conditions on the formulae reducible by the second-order quantifier elimination algorithm DLS. It is shown that DLS is compete for all modal Sahlqvist and Inductive formulae, and that all modal formulae in a single propositional variable on which DLS succeeds are canonical

Categories

Keywords

Reprint years

DOI

10.3166/jancl.16.279-296

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 105,925

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

Elementary canonical formulae: extending Sahlqvist’s theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 17-51.
Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 17-51.
Algorithmic correspondence and completeness in modal logic. IV. Semantic extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2):175-211.
Tableau-resolution based description abduction logics: An A-Box Abduction Problem Solver in Artificial Intelligence.Seyed Ahmad Mirsanei - 2023 - In The 9th International TMU Student Philosophy Conference. Tehran: Tarbiat Modares University - Department of Philosophy. pp. 133-137.
On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae.Petar Iliev - forthcoming - Logic Journal of the IGPL.
Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 221-240.
Logical Characterisation of Possibilistic and Probabilistic Descriptions of Events in Description Logics.Farshad Badie - forthcoming - Bulletin of the Section of Logic.
Description of all functions definable by formulæ of the 2nd order intuitionistic propositional calculus on some linear Heyting algebras.Dimitri Pataraia - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):457-483.

Analytics

Added to PP
2013-11-24

Downloads
47 (#521,923)

6 months
5 (#853,289)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Towards incorporating background theories into quantifier elimination.Andrzej Szalas - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):325-340.

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.
An undecidable problem in correspondence theory.L. A. Chagrova - 1991 - Journal of Symbolic Logic 56 (4):1261-1272.

Add more references