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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

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

Through your library

Similar books and articles

Herbrand style proof procedures for modal logic.Marta Cialdea - 1993 - Journal of Applied Non-Classical Logics 3 (2):205-223.
A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Virtual modality. [REVIEW]William Boos - 2003 - Synthese 136 (3):435 - 491.
An empirical analysis of modal theorem provers.Ullrich Hustadt & Renate A. Schmidt - 1999 - Journal of Applied Non-Classical Logics 9 (4):479-522.
Refutation systems in modal logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
Economy and scope.Danny Fox - 1995 - Natural Language Semantics 3 (3):283-341.
Notes on Kant's derivation of the various formulae of the categorical imperative.R. K. Gupta - 1997 - International Journal of Philosophical Studies 5 (3):383 – 396.

Analytics

Added to PP
2013-11-24

Downloads
32 (#501,434)

6 months
7 (#436,298)

Historical graph of downloads
How can I increase my downloads?

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