An Exatuination of Some Proofs in Burleigh’s Propositional Logic

New Scholasticism 38 (1):44-60 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

ISBN(s)

00286621

DOI

10.5840/newscholas196438154

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

The three dimensions of proofs.Yves Guiraud - 2006 - Annals of Pure and Applied Logic 141 (1):266-295.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
Socratic Proofs and Paraconsistency: A Case Study.Andrzej Wiśniewski, Guido Vanackere & Dorota Leszczyńska - 2005 - Studia Logica 80 (2):431-466.
Logic of proofs and provability.Tatiana Yavorskaya - 2001 - Annals of Pure and Applied Logic 113 (1-3):345-372.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - Journal of Symbolic Logic 72 (2):439 - 451.
The Method of Socratic Proofs for Modal Propositional Logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.Dorota Leszczyńska-Jasion - 2008 - Studia Logica 89 (3):365-399.
Counting proofs in propositional logic.René David & Marek Zaionc - 2009 - Archive for Mathematical Logic 48 (2):185-199.
The Complexity of Propositional Proofs with the Substitution Rule.Alasdair Urquhart - 2005 - Logic Journal of the IGPL 13 (3):287-291.
Quantified propositional logic and the number of lines of tree-like proofs.Alessandra Carbone - 2000 - Studia Logica 64 (3):315-321.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Lower Bounds to the size of constant-depth propositional proofs.Jan Krajíček - 1994 - Journal of Symbolic Logic 59 (1):73-86.
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005. Cambridge: Cambridge University Press. pp. 151-172.

Analytics

Added to PP
2011-12-02

Downloads
27 (#557,528)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references