Diophantine sets of polynomials over number fields

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].
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

Citation

Consulte el texto completo en el siguiente enlace:

Collections