Some representations of Diophantine sets

DOI10.2307/2272746MaRDI QIDQ5680116zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(6)

• 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
• Martin Davis and Hilbert's tenth problem
• In Memoriam: Raphael Mitchel Robinson

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5680116)