Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This paper is a variant of /1/. But Theorem 2 is new here.
Preview
Unable to display preview. Download preview PDF.
References
Sazonov V.Yu. Bounded set theory and polynomial computability. (In Russian) Proc. Conf. Applied Logic, Novosibirsk 1985, 188–191.
Sazonov V.Yu. Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik, 16, N7 (1980), 319–323.
Sazonov V.Yu. A logical approach to the problem "P=NP?". MFCS'80, Lect. Not. Comput. Sci. N88, 1980, 562–575.
Ershov Ju.L. Dynamic logic over admissible sets. Dokl. Akad. Nayk SSSR, 273, N5, 1983, 1045–1048.
Goncharov S.S., Sviridenko D.I. Σ-programming. (In Russian) Computing Systems, 107, Novosibirsk, 1985, 3–29.
Barwise J. Admissible sets and structures, Berlin, Springer, 1975.
Ershov Ju.L. Principle of Σ-enumeration. Dokl. Akad. Nauk SSSR, 270, N4, 1983, 786–788.
Sazonov V.Yu. Gandy theorem with predicate parameters. (In Russian) Proc. 8-th All Union Conf. on Math. Logic, Moscow, 1986, p. 167.
Sazonov V.Yu. Type-free calculus of Σ-expressions and Kripke-Platek theory with classes. (In Russian) Computing Systems, 116, Novosibirsk, 1986.
Sazonov V.Yu. Collection principle and existential quantifier. (In Russian) Computing Systems, 107, Novosibirsk, 1985, 30–39.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sazonov, V.Y. (1987). Bounded set theory and polynomial computability. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_84
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive