New Scholasticism 38 (1):44-60 (1964)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | Catholic Tradition History of Philosophy Philosophy and Religion |
| Categories | (categorize this paper) |
| ISBN(s) | 0028-6621 |
| DOI | newscholas196438154 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
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-3):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 - 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 index
2011-12-02
Total views
24 ( #476,015 of 2,519,575 )
Recent downloads (6 months)
1 ( #407,153 of 2,519,575 )
2011-12-02
Total views
24 ( #476,015 of 2,519,575 )
Recent downloads (6 months)
1 ( #407,153 of 2,519,575 )
How can I increase my downloads?
Downloads
Sorry, there are not enough data points to plot this chart.
Sorry, there are not enough data points to plot this chart.
