UPDF AI

Applying, extending, and specializing pseudorecursiveness

B. Wells

2004 · DOI: 10.1016/j.apal.2003.11.027
Annals of Pure and Applied Logic · 2 Citations

TLDR

Results strengthening and applying pseudorecursiveness are followed by the study of a property of spectra that is not uniform, which foreshadow an abstraction of this notion and its integration with the algebraic and computational studies—steps that may eventually help explicate Tarski's claim that recursively enumerable, nonrecursive but pseudoreCursive equational theories are nonetheless decidable.