Skip to main content
SpringerLink
Log in

Arithmetical degrees of index sets for complexity classes

  • Section I: Complexity
  • Conference paper
  • First Online:
Book cover Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

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. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comp. 6, 1977, pp 305–321.

    Google Scholar 

  2. J. Bell and M. Machover. A First Course in Mathematical Logic. (Amsterdam: North-Holland Pub. Co., 1977).

    Google Scholar 

  3. P. Chew and M. Machtey. A note on structure and looking-back (...). J. Comp. Sys. Sci. 22, 1981, pp 53–59.

    Google Scholar 

  4. P. Hajek. Arithmetical hierarchy and complexity of computation. Theor. Comp. Sci. 8, 1979, pp 227–237.

    Google Scholar 

  5. D. Joseph and P. Young. Independence results in computer science? J. Comp. Sys. Sci. 23, 1981, pp 205–222.

    Google Scholar 

  6. D. Kozen. Indexings of subrecursive classes. Theoretical Computer Science 11, 1980, pp 277–301.

    Google Scholar 

  7. D. Leivant. Unprovability of theorems of complexity theory in weak number theories. Theor. Comp. Sci. 18, 1982, pp 259–268.

    Google Scholar 

  8. L. Landweber and E. Robertson. Recursive properties of abstract complexity classes. J. ACM 19, 1972, pp 296–308.

    Google Scholar 

  9. K. Regan. Computability, enumerability, and the polynomial hierrchy. M.Sc. qualif. dissertation, Oxford, 1982.

    Google Scholar 

  10. H. Rogers. Theory of Recursive Functions and Effective Computability. (New York: McGraw-Hill, 1967).

    Google Scholar 

  11. U. Schöning. Untersuchungen zur Struktur von NP... Ph.D dissertation, Stuttgart, 1981.

    Google Scholar 

  12. U. Schöning. A uniform approach to obtaining diagonal sets in complexity classes. Theor. Comp. Sci. 18, 1982, pp 95–103.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Merton College, OX1 4JD, Oxford, U.K.

    Kenneth W. Regan

Authors
  1. Kenneth W. Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Regan, K.W. (1984). Arithmetical degrees of index sets for complexity classes. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation