Decidability of Sub-theories of Polynomials over a Finite Field
From MaRDI portal
Publication:3576076
DOI10.1007/978-3-642-03073-4_45zbMath1233.03022OpenAlexW1593003561MaRDI QIDQ3576076
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_45
Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (3)
LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD ⋮ THE DIOPHANTINE PROBLEM FOR ADDITION AND DIVISIBILITY OVER SUBRINGS OF THE RATIONALS ⋮ On an exponential predicate in polynomials over finite fields
Cites Work
- 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
- Extensions of Hilbert's tenth problem
- 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: Decidability of Sub-theories of Polynomials over a Finite Field