Recursively enumerable sets of polynomials over a finite field are diophantine

被引:7
|
作者
Demeyer, Jeroen [1 ]
机构
[1] Univ Ghent, Dept Pure Math & Comp Algebra, B-9000 Ghent, Belgium
关键词
D O I
10.1007/s00222-007-0078-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We construct a Diophantine interpretation of F-q[W, Z] over F-q[ Z]. Using this together with a previous result that every recursively enumerable (r.e.) relation over F-q[Z] is Diophantine over F-q[W, Z], we will prove that every r.e. relation over F-q[Z] is Diophantine over F-q[Z]. We will also look at recursive infinite base fields F, algebraic over F-p. It turns out that the Diophantine relations over F[Z] are exactly the relations which are r.e. for every recursive presentation.
引用
收藏
页码:655 / 670
页数:16
相关论文
共 50 条