Classical logic, intuitionistic logic, and the Peirce rule

Notre Dame Journal of Formal Logic 33 (2):229-235 (1992)

Abstract

A simple method is provided for translating proofs in Grentzen's LK into proofs in Gentzen's LJ with the Peirce rule adjoined. A consequence is a simpler cut elimination operator for LJ + Peirce that is primitive recursive.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,855

External links

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

Through your library

Analytics

Added to PP
2010-08-24

Downloads
105 (#114,576)

6 months
1 (#386,001)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Citations of this work

No citations found.

Add more citations

Similar books and articles

Truth Table Logic, with a Survey of Embeddability Results.Neil Tennant - 1989 - Notre Dame Journal of Formal Logic 30 (3):459-484.
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Axioms for Classical, Intuitionistic, and Paraconsistent Hybrid Logic.Torben Braüner - 2006 - Journal of Logic, Language and Information 15 (3):179-194.
The Logic of Peirce Algebras.Maarten De Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
Peirce’s Triadic Logic Revisited.Robert Lane - 1999 - Transactions of the Charles S. Peirce Society 35 (2):284 - 311.