Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus

Journal of Symbolic Logic 11 (3):92-93 (1946)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2266758

Links

PhilArchive



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

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

Review: Jerzy Slupecki, Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus. [REVIEW]Henryk Stonert - 1946 - Journal of Symbolic Logic 11 (3):92-93.
A proof of axiomatizability of łukasiewicz’s three-valued implicational propositional calculus.T. Prucnal - 1967 - Studia Logica 20 (1):144-144.
Proof of axiomatizability of full many-valued systems of calculus of propositions.Jerzy Słupecki - 1971 - Studia Logica 29 (1):155 - 168.
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.
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
Atomic polymorphism.Fernando Ferreira & Gilda Ferreira - 2013 - Journal of Symbolic Logic 78 (1):260-274.
Simulating non-prenex cuts in quantified propositional calculus.Emil Jeřábek & Phuong Nguyen - 2011 - Mathematical Logic Quarterly 57 (5):524-532.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
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.
Propositional proof compressions and DNF logic.L. Gordeev, E. Haeusler & L. Pereira - 2011 - Logic Journal of the IGPL 19 (1):62-86.
Inferentializing consequence.Jaroslav Peregrin - unknown
A proof of completeness of the two-valued propositional calculus.W. Sadowski - 1961 - Studia Logica 11 (1):55-55.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
Three contributions to the two-valued propositional calculus.Stanisław Jaśkowski - 1975 - Studia Logica 34 (1):121 - 132.
Universal Classes of MV-Chains with Applications to Many-valued Logics.Joan Gispert - 2002 - Mathematical Logic Quarterly 48 (4):582-601.

Analytics

Added to PP
2015-02-05

Downloads
4 (#1,556,099)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references