Preview
Unable to display preview. Download preview PDF.
References
J. Hartmanis and J.E. Hopcroft, Independence results in computer science, SIGACT News 8 (4), (1976) 13–24.
J.Hartmanis, Feasible computations and provable complexity properties, SIAM, 1978.
P. Hajek, Arithmetical hierarchy and complexity of computation, Theoret. Comp. Sc., 8 (1979) 227–237.
M.I. Kanovič, Complex properties of context-sensitive languages, Boviet Math. Dokl. 18 (1977), No. 2, 383–387.
T. Baker, J. Gill and R. Solovay, Relativizations of the P = NP question, SIAM J. Comput. 4 (1975) 431–442.
H.Rogers Jr., Theory of recursive functions and effective computability, N.Y., 1967.
Author information
Authors and Affiliations
Editor information
Rights 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