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

Links

PhilArchive



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

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

Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
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.
The Decidability of Dependency in Intuitionistic Propositional Logi.Dick De Jongh & L. A. Chagrova - 1995 - Journal of Symbolic Logic 60 (2):498 - 504.
The decidability of dependency in intuitionistic propositional Logi.Dick de Jongh & L. A. Chagrova - 1995 - Journal of Symbolic Logic 60 (2):498-504.
An empirical analysis of modal theorem provers.Ullrich Hustadt & Renate A. Schmidt - 1999 - Journal of Applied Non-Classical Logics 9 (4):479-522.
Structured anaphora to quantifier domains: A unified account of quantificational & modal subordination and exceptional wide scope.Adrian Brasoveanu - manuscript
The Processing Domain of Dcope Interaction.Oliver Bott & Fabian Schlotterbeck - 2015 - Journal of Semantics 32 (1):fft015.
Unification For Quantified Formulae.Wilfried Sieg - unknown
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.
On different intuitionistic calculi and embeddings from int to S.Uwe Egly - 2001 - Studia Logica 69 (2):249-277.
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.
Every finitely reducible logic has the finite model property with respect to the class of ♦-formulae.Stéphane Demri & Ewa Orłowska - 1999 - Studia Logica 62 (2):177 - 200.

Analytics

Added to PP
2013-11-24

Downloads
31 (#503,056)

6 months
6 (#504,917)

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