A propositional calculus for inconsistent deductive systems

Logic and Logical Philosophy 7:35 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

2014

DOI

10.12775/llp.1999.003

Links

PhilArchive



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

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

On the discussive conjunction in the propositional calculus for inconsistent deductive systems.Stanisław Jaśkowski - 1999 - Logic and Logical Philosophy 7:57.
Propositional calculus for contradictory deductive systems.Stanisław Jaśkowski - 1969 - Studia Logica 24 (1):143 - 160.
Three contributions to the two-valued propositional calculus.Stanisław Jaśkowski - 1975 - Studia Logica 34 (1):121 - 132.
Beyond Rasiowan Systems: Unital Deductive Systems.Alexei Y. Muravitsky - 2014 - Logica Universalis 8 (1):83-102.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
The deduction rule and linear and near-linear proof simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
Inferentializing consequence.Jaroslav Peregrin - unknown
A deduction theorem schema for deductive systems of propositional logics.Janusz Czelakowski & Wies?aw Dziobiak - 1991 - Studia Logica 50 (3-4):385 - 390.
The formalization of implication in propositional logic.Patrick F. Schindler - unknown
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.
Algebraic Study of Two Deductive Systems of Relevance Logic.Josep Maria Font & Gonzalo Rodríguez - 1994 - Notre Dame Journal of Formal Logic 35 (3):369-397.
Modal logic as metalogic.Kosta Došen - 1992 - Journal of Logic, Language and Information 1 (3):173-201.

Analytics

Added to PP
2014-01-15

Downloads
64 (#254,276)

6 months
11 (#244,932)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Wittgenstein on Incompleteness Makes Paraconsistent Sense.Francesco Berto - 2008 - In Francesco Berto, Edwin Mares, Koji Tanaka & Francesco Paoli (eds.), Paraconsistency: Logic and Applications. Springer. pp. 257--276.

View all 52 citations / Add more citations

References found in this work

Modalities and quantification.Rudolf Carnap - 1946 - Journal of Symbolic Logic 11 (2):33-64.
Zur Logik der Modalitäten.Oskar Becker - 1930 - Max Niemeyer Verlag.

Add more references