Arithmetical representation of recursively enumerable sets
From MaRDI portal
Publication:3235358
DOI10.2307/2268755zbMath0073.25204MaRDI QIDQ3235358
Publication date: 1956
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2268755
Related Items
In Memoriam: Raphael Mitchel Robinson, Some representations of Diophantine sets, Computing degrees of unsolvability, A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets, Arithmetical representations of enumerable sets with a small number of quantifiers, Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets, Diophantine complexity, Three universal representations of recursively enumerable sets, Reductions of Hilbert's tenth problem
Cites Work