Abstract
The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
- 1 DAVIS, MARTIN, and PUTMAN, HILARY. A computing procedure for quantification theory. J. ACM 7 (1960), 201-215. Google ScholarDigital Library
- 2 GILMORE, P. C. A proof method for quantification theory. IBM J. Res. Dev. 4 (1960), 28-35.Google ScholarDigital Library
- 3 PRAWITZ, DAG. An improved proof procedure. Theoria 26, 2 (1960), 102-139.Google Scholar
Recommendations
Theorem Proving Modulo
AbstractDeduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits one to separate ...
Comments