# A Computing Procedure for Quantification Theory

@article{Davis1960ACP, title={A Computing Procedure for Quantification Theory}, author={Martin D. Davis and H. Putnam}, journal={J. ACM}, year={1960}, volume={7}, pages={201-215} }

The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for obtaining mathematical theorems goes back to Leibniz and has been revived by Peano around the turn of the century and by Hilbert's school in the 1920's. Hilbert, noting that all of classical mathematics could be formalized within quantification theory, declared that the problem of finding an algorithm for determining whether or not a given formula of quantification… Expand

#### Topics from this paper

#### 2,887 Citations

THE PRESENT STATE OF MECHANIZED DEDUCTION, AND THE PRESENT KNOWLEDGE OF ITS LIMITATIONS *

- Computer Science
- 2006

Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving*

- Mathematics
- 1983

Combined Decision Techniques for the Existential Theory of the Reals

- Computer Science
- Calculemus/MKM
- 2009