Arithmetical representation of recursively enumerable sets

DOI10.2307/2268755zbMath0073.25204OpenAlexW2146755812MaRDI QIDQ3235358

Raphael M. Robinson

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

zbMATH Keywords

PhilosophyFoundationsMathematical Logic

Related Items (10)

Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ In Memoriam: Raphael Mitchel Robinson ⋮ Reductions of Hilbert's tenth problem ⋮ Some representations of Diophantine sets ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ Three universal representations of recursively enumerable sets ⋮ Diophantine complexity ⋮ Arithmetical representations of enumerable sets with a small number of quantifiers ⋮ Computing degrees of unsolvability ⋮ A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets

Cites Work

• Primitive recursive functions
• Arithmetical problems and recursively enumerable predicates

This page was built for publication: Arithmetical representation of recursively enumerable sets