A Non-Heuristic Program for Proving Elementary Logical Theorems

, , &
Journal of Symbolic Logic 32 (2):266-266 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271688

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

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

Review: B. Dunham, R. Fridshal, G. L. Sward, A Non-Heuristic Program for Proving Elementary Logical Theorems; B. Dunham, R. Fridshal, J. H. North, Exploratory Mathematics by Machine; B. Dunham, J. H. North, Theorem Testing by Computer. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266-266.
Indirect-deduction theorems.S. J. Surma - 1967 - Studia Logica 20 (1):164-166.
Experiments with a Multipurpose, Theorem-Proving Heuristic Program.James R. Slagle & Philip Bursky - 1970 - Journal of Symbolic Logic 35 (4):596-596.
Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program. [REVIEW]David C. Cooper - 1970 - Journal of Symbolic Logic 35 (4):596-596.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.
Epistemology of visual thinking in elementary real analysis.Marcus Giaquinto - 1994 - British Journal for the Philosophy of Science 45 (3):789-813.
Automatic proofs for theorems on predicate calculus.Sueli Mendes dos Santos - 1972 - [Rio de Janeiro,: Pontificia Universidade Católica do Rio de Janeiro]. Edited by Marilia Rosa Millan.
Formal Mathematics for Verifiably Correct Program Synthesis.Christoph Kreitz - 1996 - Logic Journal of the IGPL 4 (1):75-94.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Applications of elementary submodels in general topology.Stefan Geschke - 2002 - Synthese 133 (1-2):31 - 41.
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
The use of a formal simulator to verify a simple real time control program.Robert Boyer - manuscript
Representation Reducing Heuristics for Semi-Automated Scientific Discovery.Joseph Perry Phillips - 2000 - Dissertation, University of Michigan

Analytics

Added to PP
2015-02-05

Downloads
12 (#1,078,270)

6 months
1 (#1,469,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Towards feasible solutions of the tautology problem.Bradford Dunham & Hao Wang - 1976 - Annals of Mathematical Logic 10 (2):117-154.

Add more citations

References found in this work

No references found.

Add more references