Skip to main content
SpringerLink
Log in

The topology of provability in complexity theory

  • Conference paper
  • First Online:
Structure in Complexity Theory

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

  • 131 Accesses

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. K. Ambos-Spies. Sublattices of the polynomial-time degrees. STACS '84, Paris, France, April 1984. / Inform. and Control 65, April 1985, pp 63–84.

    Google Scholar 

  2. K. Ambos-Spies. Three theorems on polynomial degrees of NP sets. Proc. 26th FOCS, 1985, pp 51–55.

    Google Scholar 

  3. T. Baker, J. Gill, and R. Solovay. Relativisations of the P=NP? question. SIAM J. Comput. 4, No. 4, 1975, pp 431–442.

    Article  Google Scholar 

  4. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Math. Syst. Theory 18, 1985.

    Google Scholar 

  5. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, No. 2, June 1977, pp 305–321.

    Article  Google Scholar 

  6. S. Breidtbart. On splitting recursive sets. J. Comp. Sys. Sci. 17, 1987, pp 56–64.

    Google Scholar 

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

    Article  Google Scholar 

  8. N. Cutland. Computability. (Cambridge, UK: Camb. University Press, 1980.)

    Google Scholar 

  9. J. Dugundy. Topology. (Boston: Allyn and Bacon, 1966.)

    Google Scholar 

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

    Google Scholar 

  11. J. Hartmanis. Feasible computations and provable complexity properties. Monograph, Society for Industrial and Applied Mathematics, 1978.

    Google Scholar 

  12. J. Hartmanis. Independence results about context-free languages and lower bounds. Draft, Cornell University, 1984/Info. Proc. Lett., to appear.

    Google Scholar 

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

    Google Scholar 

  14. W. Kowalczyk. Some connections between presentability of complexity classes and the power of formal systems of reasoning. Proc. MFCS '84, Prague, Czechoslovakia, Aug. 1984. Springer LNCS 201, 1984, pp 364–368.

    Google Scholar 

  15. D. Kozen. Indexings of subrecursive classes. Theor. Comp. Sci. 11, 1980, pp 277–301.

    Google Scholar 

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

    Article  Google Scholar 

  17. J. Lake. Characterizating the largest countable partial ordering. Zeitschr. f. Math. Logik und Grund-lagen d. Math. 21, 1975, pp 353–354.

    Google Scholar 

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

    Google Scholar 

  19. S. Mahaney. On the number of isomorphism classes of NP-complete sets. Proc. 22nd FOCS, 1984, pp 271–278.

    Google Scholar 

  20. S. Mahaney and P. Young. Orderings of polynomial isomorphism types. Draft, 1983. / Theor. Comp. Sci. 39, No. 2, August 1985, pp 207–224.

    Google Scholar 

  21. K. Melhorn. Polynomial and abstract subrecursive classes. Proc. 14th FOCS, 1976, pp 96–109.

    Google Scholar 

  22. K. Regan. On diagonalization methods and the structure of language classes. Proc. FCT '83, Borgholm, Sweden. Springer LNCS 158, pp 368–380.

    Google Scholar 

  23. K. Regan. Arithmetical degrees of index sets for complexity classes. Proc. Logic & Machines '83, Muenster, W. Germany, May 1983. Springer LNCS 171, 1984, pp 118–130.

    Google Scholar 

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

    Google Scholar 

  25. D. Schmidt. On the complement of one complexity class in another. Proc. Logic and Machines '83, ibid. Borgholm, Sweden. Springer LNCS 171, 1984, pp 77–87.

    Google Scholar 

  26. D. Schmidt. The recursion-theoretic structure of complexity classes. Theor. Comp. Sci. 38, Nos. 2–3, 1985, pp 143–156.

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  29. A. Visser. Numerations, λ-calculus, and arithmetic. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. (London/New York: Academic Press, 1980.)

    Google Scholar 

  30. P. Young. Some structural properties of polynomial reducibilities and sets in NP. Proc. 15th STOC, 1983, pp 392–401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Merton College, OX1 4JD, Oxford, England

    Kenneth W. Regan

Authors
  1. Kenneth W. Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan L. Selman

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Regan, K.W. (1986). The topology of provability in complexity theory. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-16486-3_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16486-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation