On an exponential predicate in polynomials over finite fields-Reference-Cited by-同舟云学术

On an exponential predicate in polynomials over finite fields

Published:2010-02-18 Issue:7 Volume:138 Page:2569-2583
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Sirokofskich Alla

Abstract

We show that the theory of the set of polynomials in F q [ t ] \mathbb {F}_q[t] , where F q \mathbb {F}_q is a finite field, in a language including addition and a predicate for the relation “ x x is a power of t t ” is model-complete and therefore decidable.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/2010-138-07/S0002-9939-10-10258-5/S0002-9939-10-10258-5.pdf

Reference12 articles.

1. Computer Science and Scientific Computing;Davis, Martin D.,1994

2. The Diophantine problem for polynomial rings and fields of rational functions;Denef, J.;Trans. Amer. Math. Soc. {\bf242},1978

3. The Diophantine problem for polynomial rings of positive characteristic;Denef, J.,1979

4. The Diophantine problem for addition and divisibility;Lipshitz, L.;Trans. Amer. Math. Soc.,1978

5. Undecidability of existential theories of rings and fields: a survey;Pheidas, Thanases,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Notes on the decidability of addition and the Frobenius map for polynomials and rational functions;Reports on Mathematical Logic;2022-11-28

2. Defining Multiplication in Some Additive Expansions of Polynomial Rings;Communications in Algebra;2016-04-25

3. Decidability questions for a ring of Laurent polynomials;Annals of Pure and Applied Logic;2012-05

4. LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD;International Journal of Foundations of Computer Science;2011-11