Skip to main content
SpringerLink
Log in

On diagonalization methods and the structure of language classes

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

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.

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, And Computation. (Reading, Mass: Addison-Wesley 1979)

    Google Scholar 

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

    Google Scholar 

  5. R. Ladner. On the structure of polynomial-time reducibility. J. ACM 22, 1975, pp 155–171.

    Google Scholar 

  6. L. Landweber, R. Lipton, and E. Robertson. On the structure of sets in NP and other classes. TCS 15, 1981, pp 181–200.

    Google Scholar 

  7. K. Regan. Computability, enumerability, and the polynomial hierarchy. M.Sc. qualifying dissertation, Oxford, 1982.

    Google Scholar 

  8. K. Regan. Arithmetical degrees of index sets for complexity classes. Draft, in preparation for submission to TCS in 1983.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  12. P. Young. Some structural properties of polynomial reducibilities and sets in NP. Proc. 15th ACM Symp., 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Merton College, OX1-4JD, Oxford, UK

    Kenneth W. Regan

Authors
  1. Kenneth W. Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Regan, K.W. (1983). On diagonalization methods and the structure of language classes. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation