This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cook, S.A., The Complexity of Theorem Proving Procedures, Conf. Record of 3rd ACM Symposium on Theory of Computing, 1971, 151–158.
Cook, S.A., Feasibly Constructive Proofs and the Propositional Calculus, 17th Ann.Symp. on Theory of Computing, Conf. Record, May 1975, 83–97.
Dekhtjar', M.I., On the impossibility to eliminate the complete enumeration under the computation of functions relatively to their graphs, Doklady Akad.Nauk SSSR, v. 189, 1969, 748–751 (in Russian).
Yesenin-Volpin, A.S., An analysis of potential feasibility, Logiceskije issledovanija, Akad.Nauk SSSR, Moscow, 1959, 218–262 (in Russian).
Fagin, R., Generalized First-Order Spectra and Polynomial Time Recognizable sets, Complexity of Computations, SIAM-AMS Proc., vol.7, 1974, 43–73.
Hartmanis, J., Hopcroft, J.E., Independence Result in Computer Science, ACM SIGACT News, 8 (1976), No 4, 3–24.
Jones, N.D., Selman, A.L., Turing Machines and the Spectra of First-Order Formulas with Equality, Proc. 4th ACM Symp. on Theory of Computing, 1972, 157–167.
Levin, L.A., Universal Enumeration Tasks, Problemy Peredaci Informacii, IX, 3, 1973, 115–116 (in Russian).
Lipton, R., Model Theoretic Aspects of Computational Complexity, Proc. of the 1978 FOCS Symposium, 193–200 (1978).
De Millo, R.A., Lipton, R.J., Some connections between mathematical Logic and Complexity Theory, Proc. of the 1979 STOC, 153–159 (1979).
O'Donnell, M., A Programming Language Theorem which is Independent of Peano Arithmetic, Proc. of the 1979 STOC, 176–188 (1979).
Parikh, K., Existence and Feasibility in Arithmetic, the Journal of Symbolic Logic, vol. 36, No 3, 1971, 494–508.
Sazonov, V. Yu., Theory in which lower exponential complexity bound for NP complete tasks is unprovable, 5th All-Union Conf. on math. logic, Institute of Mathem., Novosibirsk, 1979, p. 133 (in Russian).
Sazonov, V.Yu., Polynomial computability and recursivity in finite domains, to be published.
Trakhtenbrot, B.A., The impossibility of an algorithm for the decidability problem on finite classes, Doklady AN SSSR, 70, No 4 (1950), 569–572 (in Russian).
Trakhtenbrot, B.A., The formalization of some notions in terms of the complexity of computations, P. Suppes et al., eds., Logic, Methodology and Philosophy of Sciences IV, North-Holl., 1973, 205–213 (in Russian).
Takeuti, G., Proof Theory, North-Holland, 1975.
Yablonsky, S.V., On the algorithmic difficulties of minimal schemes synthesis, Problemy Kybernetiki, 2, 1959, Moscow, 75–121 (in Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sazonov, V.Y. (1980). A logical approach to the problem “P=NP?”. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022533
Download citation
DOI: https://doi.org/10.1007/BFb0022533
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive