Three universal representations of recursively enumerable sets

DOI10.2307/2272832zbMath0414.03025OpenAlexW1991582829MaRDI QIDQ3048819

James P. Jones

Publication date: 1978

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

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

zbMATH Keywords

decidabilitydiophantine equationsHilbert's tenth problemquantifier prefixarithmetical formulasuniversal representation of recursively enumerable sets

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99)

Related Items (6)

Expository notes on computability and complexity in (arithmetical) games ⋮ Some undecidable determined games ⋮ The scope of Gödel's first incompleteness theorem ⋮ On finding test data sets for loop free programs ⋮ Undecidable diophantine equations ⋮ Some diophantine forms of gödel's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• Arithmetical representation of recursively enumerable sets
• An unsolvable problem in number theory
• Diophantine Representation of the Set of Prime Numbers
• Hilbert's Tenth Problem is Unsolvable
• An explicit diophantine definition of the exponential function
• Some representations of Diophantine sets

This page was built for publication: Three universal representations of recursively enumerable sets