A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS

Journal of Symbolic Logic 48 (1):1 - 20 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273315

Links

PhilArchive



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

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

A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics VC and VCS.H. C. M. de Swart - 1983 - Journal of Symbolic Logic 48 (1):1-20.
Resolution calculus for the first order linear logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.
Canonical Constructive Systems ⋆.Arnon Avron - unknown
Hybrid logics with infinitary proof systems.Rineke Verbrugge, Gerard Renardel de Lavalette & Barteld Kooi - unknown
Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.
Investigation into certain implication-negation fragments of propositional logic.Lung-ock Chung - unknown
Algebraic aspects of cut elimination.Francesco Belardinelli, Peter Jipsen & Hiroakira Ono - 2004 - Studia Logica 77 (2):209 - 240.
Modal completeness of ILW.Dick De Jongh & Frank Veltman - 1999 - In Jelle Gerbrandy, Maarten Marx, Maarten de Rijke & Yde Venema (eds.), Essays Dedicated to Johan van Benthem on the Occasion of His 50th Birthday. Amsterdam University Press.
Cut-free sequent and tableau systems for propositional diodorean modal logics.Rajeev Goré - 1994 - Studia Logica 53 (3):433 - 457.
Meeting strength in substructural logics.Yde Venema - 1995 - Studia Logica 54 (1):3 - 32.
A constructive proof of Craig's interpolation lemma for m-valued logic.Anita Waselewska - 1979 - Studia Logica 38 (3):267 - 275.
The realization theorem for s5 a simple, constructive proof.Melvin Fitting - unknown
A loop-free decision procedure for modal propositional logics k4, s4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.

Analytics

Added to PP
2011-05-29

Downloads
16 (#883,649)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof analysis for Lewis counterfactuals.Sara Negri & Giorgio Sbardolini - 2016 - Review of Symbolic Logic 9 (1):44-75.
Trees and diagrams of decomposition.Anita Wasilewska - 1985 - Studia Logica 44 (2):139 - 158.
Theorem proving for conditional logics: CondLean and GOALD U CK.Nicola Olivetti & Gian Luca Pozzato - 2008 - Journal of Applied Non-Classical Logics 18 (4):427-473.

Add more citations

References found in this work

Semantical Analysis of Modal Logic I. Normal Propositional Calculi.Saul A. Kripke - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (5‐6):67-96.

Add more references