Propositions in Prepositional Logic Provable Only by Indirect Proofs

Mathematical Logic Quarterly 44 (1):69-91 (1998)
  Copy   BIBTEX

Abstract

In this paper it is shown that addition of certain reductions to the standard cut removing reductions of deductions in prepositional logic makes prepositional logic non-normalizable. From this follows that some provable propositions in prepositional logic has no direct proof

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-01-16

Downloads
33 (#496,568)

6 months
6 (#575,766)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ekman’s Paradox.Peter Schroeder-Heister & Luca Tranchini - 2017 - Notre Dame Journal of Formal Logic 58 (4):567-581.
Normalizability, cut eliminability and paradox.Neil Tennant - 2016 - Synthese 199 (Suppl 3):597-616.
Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.

View all 9 citations / Add more citations

References found in this work

Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
Natural Deduction: A Proof-Theoretical Study.Richmond Thomason - 1965 - Journal of Symbolic Logic 32 (2):255-256.
The Collected Papers of Gerhard Gentzen. [REVIEW]G. Kreisel - 1971 - Journal of Philosophy 68 (8):238-265.

Add more references