Lewis, Forbes D. On unsolvability in subrecursive classes of predicates. (English) Zbl 0316.02050 Notre Dame J. Formal Logic 20, 55-67 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 03D80 Applications of computability and recursion theory 03D30 Other degrees and reducibilities in computability and recursion theory 68Q45 Formal languages and automata 03D55 Hierarchies of computability and definability Keywords:FORMAL LANGUAGE; UNSOLVABILITY; UNDECIDABILITY; SUBRECURSIVE CLASSES PDF BibTeX XML Cite \textit{F. D. Lewis}, Notre Dame J. Formal Logic 20, 55--67 (1979; Zbl 0316.02050) Full Text: DOI