On an exponential predicate in polynomials over finite fields

DOI10.1090/S0002-9939-10-10258-5MaRDI QIDQ3574832zbMATH OpenFDO

Authors Alla Sirokofskich

Publication date 2 July 2010

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

Full work available at URL https://doi.org/10.1090/S0002-9939-10-10258-5

zbMATH Keywords

decidabilitypolynomialsmodel-completenessmodel theory of finite fields

Mathematics Subject Classification ID

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

Recommendations

• Decidability of sub-theories of polynomials over a finite field
• The field of p-adic numbers with a predicate for the powers of an integer
• Model theory of finite fields and pseudo-finite fields
• The diophantine problem for addition and divisibility for subrings of rational functions over finite fields
• scientific article; zbMATH DE number 2020228

Cites work

• scientific article; zbMATH DE number 5285210 (Why is no real title available?)
• scientific article; zbMATH DE number 3715696 (Why is no real title available?)
• Decidability of sub-theories of polynomials over a finite field
• Elimination theory for addition and the frobenius map in polynomial rings
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• The Diophantine Problem for Addition and Divisibility
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
• Undecidability in number theory
• Undecidability of existential theories of rings and fields: A survey
• Undecidable Rings

Cited in

(8)

• On subwords in the base-q expansion of polynomial and exponential functions
• An expansion of F̃_p
• Defining multiplication in some additive expansions of polynomial rings
• On the ranges of discrete exponentials
• Decidability questions for a ring of Laurent polynomials
• scientific article; zbMATH DE number 6327479 (Why is no real title available?)
• Logical characterization of recognizable sets of polynomials over a finite field
• Decidability of sub-theories of polynomials over a finite field

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574832)