On unsolvability in subrecursive classes of predicates

DOI10.1305/ndjfl/1093882401zbMath0316.02050OpenAlexW2005838602MaRDI QIDQ1221106

Forbes D. Lewis

Publication date: 1979

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093882401

zbMATH Keywords

FORMAL LANGUAGESUBRECURSIVE CLASSESUNDECIDABILITYUNSOLVABILITY

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

Unnamed Item