A logical approach to the problem “P=NP?”

This publication has 9 references indexed in Scilit:

• Some Connection Between Mathematical Logic and Complexity Theory,
  Published by Defense Technical Information Center (DTIC) ,1979
• A programming language theorem which is independent of Peano Arithmetic
  Published by Association for Computing Machinery (ACM) ,1979
• Model theoretic aspects of computational complexity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Independence results in computer science
  ACM SIGACT News, 1976
• Feasibly constructive proofs and the propositional calculus (Preliminary Version)
  Published by Association for Computing Machinery (ACM) ,1975
• Formalization of Some Notions in Terms of Computational Complexity
  Published by Elsevier ,1973
• Turing machines and the spectra of first-order formulas with equality
  Published by Association for Computing Machinery (ACM) ,1972
• Existence and feasibility in arithmetic
  The Journal of Symbolic Logic, 1971
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971