Some representations of Diophantine sets

DOI10.2307/2272746zbMath0264.02042OpenAlexW2007089758MaRDI QIDQ5680116

Raphael M. Robinson

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272746

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ In Memoriam: Raphael Mitchel Robinson ⋮ 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

Cites Work

• Arithmetical representation of recursively enumerable sets
• Arithmetical problems and recursively enumerable predicates

This page was built for publication: Some representations of Diophantine sets