Transfer of sequent calculus strategies to resolution for S4

, &
In Heinrich Wansing (ed.), Proof theory of modal logic. Boston: Kluwer Academic Publishers. pp. 2--17 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

Resolution calculus for the first order linear logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.
Cuts, Gluts and Gaps.Vincent Degauquier - 2012 - Logique Et Analyse 55 (218):229-240.
Minimum propositional proof length is NP-Hard to linearly approximate.Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi - 2001 - Journal of Symbolic Logic 66 (1):171-191.
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
A purely syntactic and cut-free sequent calculus for the modal logic of provability.Francesca Poggiolesi - 2009 - Review of Symbolic Logic 2 (4):593-611.
Varieties of linear calculi.Sara Negri - 2002 - Journal of Philosophical Logic 31 (6):569-590.
leanTAP Revisited.Melvin Fitting - unknown
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus. [REVIEW]Peter Schroeder-Heister - 2011 - Journal of Philosophical Logic 40 (1):95 - 101.
Synchronized Linear-Time Temporal Logic.Heinrich Wansing & Norihiro Kamide - 2011 - Studia Logica 99 (1-3):365-388.
Translations from natural deduction to sequent calculus.Jan von Plato - 2003 - Mathematical Logic Quarterly 49 (5):435.
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language.Michael Gabbay - 2011 - Journal of Symbolic Logic 76 (2):673 - 699.
A proof-search procedure for intuitionistic propositional logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.

Analytics

Added to PP
2014-01-31

Downloads
17 (#863,882)

6 months
3 (#961,692)

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

No references found.

Add more references