Three universal representations of recursively enumerable sets

DOI10.2307/2272832MaRDI QIDQ3048819zbMATH OpenOpenAlexFDO

Authors 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

arithmetical formulasdecidabilitydiophantine equationsHilbert's tenth problemquantifier prefixuniversal representation of recursively enumerable sets

Mathematics Subject Classification ID

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

Cites work

• Acta Arithmetica: Index of volumes 91--100 (1999--2001)
• An explicit diophantine definition of the exponential function
• An unsolvable problem in number theory
• Arithmetical representation of recursively enumerable sets
• Diophantine Representation of the Set of Prime Numbers
• Hilbert's Tenth Problem is Unsolvable
• scientific article; zbMATH DE number 3029480 (Why is no real title available?)
• Some representations of Diophantine sets
• The decision problem for exponential diophantine equations

Cited in

(7)

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

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

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