Sciweavers

Share
CIE
2009
Springer

Decidability of Sub-theories of Polynomials over a Finite Field

9 years 10 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in the language which contains symbols for addition, multiplication by t, inequalities of degrees, divisibility of degrees by a positive integer and, for each d ∈ Fq[t], a symbol for divisibility by d. We discuss the possibility of extending our results to the structure which results if one includes a predicate for the relation “x is a power of t”.
Alla Sirokofskich
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CIE
Authors Alla Sirokofskich
Comments (0)
books