Skip to main content

A uniform independence of invariant sentences

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

  • 124 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Hartmanis and J.E. Hopcroft, Independence results in computer science, SIGACT News 8 (4), (1976) 13–24.

    Google Scholar 

  2. J.Hartmanis, Feasible computations and provable complexity properties, SIAM, 1978.

    Google Scholar 

  3. P. Hajek, Arithmetical hierarchy and complexity of computation, Theoret. Comp. Sc., 8 (1979) 227–237.

    Google Scholar 

  4. M.I. Kanovič, Complex properties of context-sensitive languages, Boviet Math. Dokl. 18 (1977), No. 2, 383–387.

    Google Scholar 

  5. T. Baker, J. Gill and R. Solovay, Relativizations of the P = NP question, SIAM J. Comput. 4 (1975) 431–442.

    Google Scholar 

  6. H.Rogers Jr., Theory of recursive functions and effective computability, N.Y., 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanovič, M.I. (1984). A uniform independence of invariant sentences. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030316

Download citation

  • DOI: https://doi.org/10.1007/BFb0030316

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics