Three universal representations of recursively enumerable sets

DOI10.2307/2272832zbMATH Open0414.03025OpenAlexW1991582829MaRDI QIDQ3048819FDOQ3048819

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 of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Cites Work

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

Cited In (6)

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

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)