Decidability of Sub-theories of Polynomials over a Finite Field-Reference-Cited by-同舟云学术

Decidability of Sub-theories of Polynomials over a Finite Field

Published:2009 Issue: Volume: Page:437-446
ISSN:0302-9743
Container-title:Mathematical Theory and Computational Practice
language:
Short-container-title:

Author:

Sirokofskich Alla

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03073-4_45

Reference11 articles.

1. Denef, J.: The diophantine problem for polynomial rings and fields of rational functions. Transactions of the American Mathematical Society 242, 391–399 (1978)

2. Denef, J.: The diophantine problem for polynomial rings of positive characteristic, Logic Colloquium, vol. 78, pp. 131–145. North Holland, Amsterdam (1984)

3. Lipshitz, L.: The diophantine problem for addition and divisibility. Transactions of the American Mathematical Society 235, 271–283 (1978)

4. Pheidas, T.: Extensions of Hilbert’s Tenth Problem. The Journal of Symbolic Logic 59(2), 372–397 (1994)

5. Pheidas, T., Zahidi, K.: Undecidability of existential theories of rings and fields: A survey. Contemporary Mathematics 270, 49–106 (2000)

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

1. THE DIOPHANTINE PROBLEM FOR ADDITION AND DIVISIBILITY OVER SUBRINGS OF THE RATIONALS;The Journal of Symbolic Logic;2017-09

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

3. On an exponential predicate in polynomials over finite fields;Proceedings of the American Mathematical Society;2010-02-18