Non-generable RE sets

  • Douglas Cenzer
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. Chomsky, On certain formal properties of grammars, Information and Control 2 (1959), 137–167.Google Scholar
  2. [2]
    R. E. Ladner, Mitotic RE sets, J. Symbolic Logic 38 (1973), 199–211.Google Scholar
  3. [3]
    —, A completely mitotic nonrecursive RE degree, Trans. Amer. Math. Soc. 184 (1973), 479–507.Google Scholar
  4. [4]
    J.R.Shoenfield, Degrees of unsolvability, North-Holland (1971).Google Scholar
  5. [5]
    A. Yasuhara, Recursive function theory and logic, Acad. Press (1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Douglas Cenzer
    • 1
  1. 1.University of FloridaUSA

Personalised recommendations