Lower bounds for natural proof systems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1977-October, Issue , 1977, Pages 254-266

  Kozen, Dexter ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLETE THEORY; LOGICAL THEORIES; LOWER BOUNDS; NATURAL PROOFS; POLYNOMIAL SPACE; POLYNOMIAL-TIME; PSPACE-COMPLETE; SPACE BOUNDS;

POLYNOMIAL APPROXIMATION;

EID: 85046561721     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1977.16     Document Type: Conference Paper

References (10)

1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass, 1975.
2. Cardoza, E., R. Lipton, and A.R. Meyer, "Exponential Space Complete Problems for Petri Nets and Commutative Semi-groups," Proc. 8th ACM STOC, May 1976, pp. 50-54.
3. Cook, S. and R. Reckhow, "On the Lengths of Proofs in the Propositional Calculus," Proc. 6th ACM STOC. May 1974. pp. 135-148.
4. Galil, Z., The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus, Ph.D. Thesis. Cornell University, June 1975.
5. Knuth, D.E., The Art of Computer Programming, v. 3, Sorting and Searching, Addison-Wesley, Reading, Mass, 1975.
6. Kozen, D., "Complexity of Finitely Presented Algebras," Proc. 9th ACM STOC, May 1977, pp. 164-177.
7. Ladner, R.E., "The Circuit Value Problem is Logspace Complete for P," SIGACT News 7:1, January 1975.
8. Paul, W.J., R.E. Tarjan, and J.R. Celoni. "Space Bounds for a Game on Graphs," Proc. 8th ACM STOC, May 1976, pp. 149-160.
9. Savitch, W.J., "Relationships Between Nondeterministic and Determinstic Tape Complexities," J. Comput. Syst. Sci. 4, 1970.
10. Tseitin, G.S., "On the Complexity of Derivations in the Propositional Calculus," Studies in Constructive Mathematics and Mathematical Logic, Part II, A.O. Silenko, ed., 1968, pp. 115-125.