A Proof Method for Quantification Theory: Its Justification and Realization
Paul C. Gilmore · IBM Journal of Research and Development · 1960
A program is described which can provide a computer with quick logical facility for syllogisms and moderately more complicated sentences. The program realizes a method for proving that a sentence of quantification theory is logically true. The program, furthermore, provides a decision procedure over a subclass of the sentences of quantification theory. The subclass of sentences for which the program provides a decision procedure includes all syllogisms. Full justification of the method is given. A program for the IBM 704 Data Processing Machine is outlined which realizes the method. Production runs of the program indicate that for a class of moderately complicated sentences the program can produce proofs in intervals ranging up to two minutes.
Cited by 160 works. doi:10.1147/rd.41.0028
Authors
References
- An Unsolvable Problem of Elementary Number Theory
- Empirical explorations of the logic theory machine
- Introduction to Mathematical Logic.
- Untersuchungen �ber das logische Schlie�en. I
- Realization of a Geometry-Theorem Proving Machine
- Intelligent Behavior in Problem-Solving Machines
- Logic for mathematicians
- Semantic entailment and formal derivability
- A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus.
- A Non-heuristic Program for Proving Elementary Logical Theorems