On an exponential predicate in polynomials over finite fields

DOI10.1090/S0002-9939-10-10258-5zbMath1196.03050MaRDI QIDQ3574832

Alla Sirokofskich

Publication date: 2 July 2010

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

polynomialsdecidabilitymodel-completenessmodel theory of finite fields

Mathematics Subject Classification ID

Decidability and field theory (12L05) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Model theory of fields (12L12)

Related Items (3)

LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD ⋮ Defining Multiplication in Some Additive Expansions of Polynomial Rings ⋮ Decidability questions for a ring of Laurent polynomials

Cites Work

• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• Decidability of Sub-theories of Polynomials over a Finite Field
• The Diophantine Problem for Addition and Divisibility
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• Elimination theory for addition and the frobenius map in polynomial rings
• Undecidable Rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On an exponential predicate in polynomials over finite fields