Splinters of recursive functions
From MaRDI portal
Publication:3848973
DOI10.2307/2964335zbMath0112.00805OpenAlexW2132547659MaRDI QIDQ3848973
Publication date: 1960
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964335
Related Items (7)
Splinters and Turing degrees ⋮ Symmetric transrationals: the data type and the algorithmic degree of its equational theory ⋮ On sets polynomially enumerable by iteration ⋮ Learning algebraic structures from text ⋮ Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees ⋮ Remarks on retracable, regressive, and pointwise-decomposable sets ⋮ Constructive Analogues of the Group of Permutations of the Natural Numbers
Cites Work
This page was built for publication: Splinters of recursive functions