This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Chomsky, On certain formal properties of grammars, Information and Control 2 (1959), 137–167.
R. E. Ladner, Mitotic RE sets, J. Symbolic Logic 38 (1973), 199–211.
—, A completely mitotic nonrecursive RE degree, Trans. Amer. Math. Soc. 184 (1973), 479–507.
J.R.Shoenfield, Degrees of unsolvability, North-Holland (1971).
A. Yasuhara, Recursive function theory and logic, Acad. Press (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cenzer, D. (1977). Non-generable RE sets. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_105
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive