Skip to main content
SpringerLink
Log in

Bounded set theory and polynomial computability

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sazonov V.Yu. Bounded set theory and polynomial computability. (In Russian) Proc. Conf. Applied Logic, Novosibirsk 1985, 188–191.

    Google Scholar 

  2. Sazonov V.Yu. Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik, 16, N7 (1980), 319–323.

    Google Scholar 

  3. Sazonov V.Yu. A logical approach to the problem "P=NP?". MFCS'80, Lect. Not. Comput. Sci. N88, 1980, 562–575.

    Google Scholar 

  4. Ershov Ju.L. Dynamic logic over admissible sets. Dokl. Akad. Nayk SSSR, 273, N5, 1983, 1045–1048.

    Google Scholar 

  5. Goncharov S.S., Sviridenko D.I. Σ-programming. (In Russian) Computing Systems, 107, Novosibirsk, 1985, 3–29.

    Google Scholar 

  6. Barwise J. Admissible sets and structures, Berlin, Springer, 1975.

    Google Scholar 

  7. Ershov Ju.L. Principle of Σ-enumeration. Dokl. Akad. Nauk SSSR, 270, N4, 1983, 786–788.

    Google Scholar 

  8. Sazonov V.Yu. Gandy theorem with predicate parameters. (In Russian) Proc. 8-th All Union Conf. on Math. Logic, Moscow, 1986, p. 167.

    Google Scholar 

  9. Sazonov V.Yu. Type-free calculus of Σ-expressions and Kripke-Platek theory with classes. (In Russian) Computing Systems, 116, Novosibirsk, 1986.

    Google Scholar 

  10. Sazonov V.Yu. Collection principle and existential quantifier. (In Russian) Computing Systems, 107, Novosibirsk, 1985, 30–39.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, 630090, Novosibirsk, USSR

    V. Yu. Sazonov

Authors
  1. V. Yu. Sazonov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation