Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\)

DOI10.1007/s10958-010-0176-7zbMath1345.03021OpenAlexW2031515487WikidataQ122884024 ScholiaQ122884024MaRDI QIDQ393224

Martin Davis

Publication date: 16 January 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-010-0176-7

Mathematics Subject Classification ID

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

Related Items (1)

Martin Davis and Hilbert’s Tenth Problem

Cites Work

• Unnamed Item
• On the algorithmic insolvability of the word problem in group theory
• Subgroups of finitely presented groups
• Hilbert’s Tenth Problem and Mazur’s Conjecture for large subrings of $\mathbb {Q}$
• Recursively enumerable sets of positive integers and their decision problems
• The word problem

This page was built for publication: Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\)