Some connections between presentability of complexity classes and the power of formal systems of reasoning

  • Wojciech Kowalczyk
Communications
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 176)

Keywords

Polynomial Time Turing Machine Complexity Class True Sentence Peano Arithmetic 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hartmanis, J. and Hopcroft, J., Independence results in computer science, SIGACT News, vol. 8, no. 4 /1976/ pp. 13–24.Google Scholar
  2. [2]
    Hartmanis, J., Relations between diagonalization, proof systems, and complexity gaps, Theoretical Computer Science 8 /1979/ 239–253.Google Scholar
  3. [3]
    Landweber, L., Lipton, R., and Robertson, E., On the structure of sets in NP and other complexity classes, Theoretical Computer Science 15 /1981/ 181–200.Google Scholar
  4. [4]
    Schöning, U., A uniform approach to obtain diagonal sets in complexity classes, Theoretical Computer Science 18 /1982/ 95–103.Google Scholar
  5. [5]
    Sipser, M., On relativization and the existence of complete sets, 9th International Colloquium on Automata, Languages and Programing, Springer-Verlag, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Wojciech Kowalczyk
    • 1
  1. 1.Institute of MathematicsWarsaw University PKiN IX p.Warsaw

Personalised recommendations