Diophantine sets of polynomials over number fields
classification
🧮 math.NT
math.LO
keywords
diophantinenumbersetsenumerablefieldfieldspolynomialpolynomials
read the original abstract
Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.