Diophantine sets of polynomials over number fields
Number Theory
2008-09-11 v2 Logic
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].
Cite
@article{arxiv.0807.1970,
title = {Diophantine sets of polynomials over number fields},
author = {Jeroen Demeyer},
journal= {arXiv preprint arXiv:0807.1970},
year = {2008}
}
Comments
Previous version had a mistake in Proposition 18. This problem is avoided by working only with number fields instead of finitely generated fields of characteristic zero