A Mechanical Proof Procedure and its Realization in an Electronic Computer
Journal of Symbolic Logic 31 (1):126-126 (1966)
Abstract
This article has no associated abstract. (fix it)Author's Profile
DOI
10.2307/2270654
My notes
Similar books and articles
Review: Dag Prawitz, Hakon Prawitz, Neri Voghera, A Mechanical Proof Procedure and its Realization in an Electronic Computer. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):126-126.
That We See That Some Diagrammatic Proofs Are Perfectly Rigorous.Jody Azzouni - 2013 - Philosophia Mathematica 21 (3):323-338.
Proceedings [of the] Fourth Annual Symposium on Logic in Computer Science.Ieee Computer Society - 1989
Proceedings, Fifth Annual Ieee Symposium on Logic in Computer Science June 4-7, 1990, Philadelphia, Pa.Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1990
Proceedings, Eleventh Annual Ieee Symposium on Logic in Computer Science July 27-30, 1996, New Brunswick, New Jersey.Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1996
Proceedings, Sixth Annual Ieee Symposium on Logic in Computer Science July 15-18, 1991, Amsterdam, the Netherlands.Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1991
Proceedings Symposium on Logic in Computer Science, Ithaca, New York, June 22-25, 1987 ; Sponsored by the Computer Society of the Ieee Technical Committee on Mathematical Foundations of Computing in Cooperation with Acm Sigact, Association for Symbolic Logic, European Association for Theoretical Computer Science. [REVIEW]Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science, Ieee Computer Society & Special Interest Group for Automata and Computability Theory - 1987
Using mathematica to understand the computer proof of the Robbins conjecture.Branden Fitelson - manuscript
A Hybrid Abductive Inductive Proof Procedure.Oliver Ray, Krysia Broda & Alessandra Russo - 2004 - Logic Journal of the IGPL 12 (5):371-397.
Analytics
Added to PP
2015-02-05
Downloads
18 (#614,359)
6 months
3 (#224,882)
2015-02-05
Downloads
18 (#614,359)
6 months
3 (#224,882)
Historical graph of downloads
Author's Profile
Citations of this work
Natural Deduction, Hybrid Systems and Modal Logics.Andrzej Indrzejczak - 2010 - Dordrecht, Netherland: Springer.
