Arithmetical degrees of index sets for complexity classes

  • Kenneth W. Regan
Section I: Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)


Complexity Class Recursive Function Peano Arithmetic Universal Language Polynomial Hierarchy 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BH77]
    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. [BM77]
    J. Bell and M. Machover. A First Course in Mathematical Logic. (Amsterdam: North-Holland Pub. Co., 1977).Google Scholar
  3. [CM81]
    P. Chew and M. Machtey. A note on structure and looking-back (...). J. Comp. Sys. Sci. 22, 1981, pp 53–59.Google Scholar
  4. [Haj79]
    P. Hajek. Arithmetical hierarchy and complexity of computation. Theor. Comp. Sci. 8, 1979, pp 227–237.Google Scholar
  5. [JY81]
    D. Joseph and P. Young. Independence results in computer science? J. Comp. Sys. Sci. 23, 1981, pp 205–222.Google Scholar
  6. [Kz80]
    D. Kozen. Indexings of subrecursive classes. Theoretical Computer Science 11, 1980, pp 277–301.Google Scholar
  7. [Lei82]
    D. Leivant. Unprovability of theorems of complexity theory in weak number theories. Theor. Comp. Sci. 18, 1982, pp 259–268.Google Scholar
  8. [LR72]
    L. Landweber and E. Robertson. Recursive properties of abstract complexity classes. J. ACM 19, 1972, pp 296–308.Google Scholar
  9. [Re82]
    K. Regan. Computability, enumerability, and the polynomial hierrchy. M.Sc. qualif. dissertation, Oxford, 1982.Google Scholar
  10. [Rog67]
    H. Rogers. Theory of Recursive Functions and Effective Computability. (New York: McGraw-Hill, 1967).Google Scholar
  11. [Sö81]
    U. Schöning. Untersuchungen zur Struktur von NP... Ph.D dissertation, Stuttgart, 1981.Google Scholar
  12. [Sö82]
    U. Schöning. A uniform approach to obtaining diagonal sets in complexity classes. Theor. Comp. Sci. 18, 1982, pp 95–103.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Kenneth W. Regan
    • 1
  1. 1.Merton CollegeOxfordU.K.

Personalised recommendations