An improved proof procedure
Theoria 26 (2):102-139 (1960)
Abstract
This article has no associated abstract. (fix it)Author's Profile
DOI
10.1111/j.1755-2567.1960.tb00558.x
My notes
Similar books and articles
Natural Deduction: A Proof-Theoretical Study.Dag Prawitz - 1965 - Stockholm, Sweden: Dover Publications.
Extending Lambek grammars to basic categorial grammars.Wojciech Buszkowski - 1996 - Journal of Logic, Language and Information 5 (3-4):279-295.
.[author unknown] - unknown
A proof procedure for quantification theory.W. V. Quine - 1955 - Journal of Symbolic Logic 20 (2):141-149.
On some proof theoretical properties of the modal logic GL.Marco Borga - 1983 - Studia Logica 42 (4):453 - 459.
A uniform proof procedure for SCI tautologies.Aileen Michaels - 1974 - Studia Logica 33 (3):299 - 310.
Sense and Proof.Carlo Penco & Daniele Porello - 2010 - In M. D'agostino, G. Giorello, F. Laudisa, T. Pievani & C. Sinigaglia (eds.), New Essays in Logic and Philosophy of Science,. College Publicationss.
A short proof of the strong normalization of classical natural deduction with disjunction.René David & Karim Nour - 2003 - Journal of Symbolic Logic 68 (4):1277-1288.
Abduction through semantic tableaux versus abduction through goal-directed proofs.Joke Meheus & Dagmar Provijn - 2007 - Theoria 22 (3):295-304.
Analytics
Added to PP
2010-09-13
Downloads
71 (#171,361)
6 months
2 (#298,443)
2010-09-13
Downloads
71 (#171,361)
6 months
2 (#298,443)
Historical graph of downloads
Author's Profile
Citations of this work
Necessity of Thought.Cesare Cozzo - 2015 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Springer. pp. 101-20.
Computer proofs of limit theorems.W. W. Bledsoe, R. S. Boyer & W. H. Henneman - 1972 - Artificial Intelligence 3 (C):27-60.
Towards the automation of set theory and its logic.Frank Malloy Brown - 1978 - Artificial Intelligence 10 (3):281-316.
References found in this work
Solvable Cases of the Decision Problem.Wilhelm Ackermann - 1954 - Amsterdam: North-Holland Pub. Co..
