The complexity of theorem-proving procedures

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1971, Pages 151-158

  Cook, Stephen A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MACHINERY; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

COMPLEXITY OF PROOF PROCEDURES; FINITE ALPHABET; POLYNOMIAL DEGREE; POLYNOMIAL-TIME; PROPOSITIONAL FORMULAS; RECOGNITION DEVICE; SUBGRAPHS;

TURING MACHINES;

EID: 85059770931     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800157.805047     Document Type: Conference Paper

References (8)

1. D. L. Kreider and R. W. Ritchie: Predictably Computable Functionals and Definitions by Recursion. Zeitschrift fur math. Logik und Grundlagen der Math., Vol" 10, 65-80 (1964).
2. S. A. Cook: Characterizations of Pushdown Machines in terms of Time- Bounded Computers. J. Assoc. Com- 5 uting Machinery, Vol. 18, No. 1, and. 1971, pp 4-18.
3. Cobham, Alan: The intrinsic computational difficulty of functions. Proc. of the 1964 International Con- ft ress for Logic, Methodology, and the philosophy of Science, North Holland Publishing Co., Amsterdam, pp. 24-30.
4. D. G. Corneil and C. C. Gotlieb: An Efficient Algorithm for Graph Isomorphism. J. Assoc Computing Machinery Vol. 17, No. 1, Jan. 1970, pp 51-64.
5. M. Davis and H. Putnam: A Computing Procedure for Quantification Theory. J. Assoc. Computing Machinery, 1960, pp. 201-215.
6. J. H. Bennett: On Spectra. Doctoral Dissertation, Princeton University, 1962.
7. Hao Wang: Dominoes and the AEA case of the decision problems. Proc. of the Symposium on Mathematical Theory of Automata, at Polytechnic Institute of Brooklyn, 1962. pp. 23-55.
8. John Hopcroft and Jeffrey Ullman: Formal Languages and their Relation to Automata. Addison-Wesley, 1969.