Diophantine sets of polynomials over number fields
| dc.creator | Demeyer, Jeroen | |
| dc.date | 2008-07-12 | |
| dc.date | 2008-09-11 | |
| dc.date.accessioned | 2026-07-07T10:01:53Z | |
| dc.date.available | 2026-07-07T10:01:53Z | |
| dc.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]. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/0807.1970 | |
| dc.identifier | http://arxiv.org/abs/0807.1970 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168783 | |
| dc.subject | Number Theory | |
| dc.subject | Logic | |
| dc.subject | 11D99 (Primary) 03D25, 12L12, 11R09, 12E10 (Secondary) | |
| dc.title | Diophantine sets of polynomials over number fields | |
| dc.type | text |