Quantifier elimination over finite fields using Gröbner bases
From MaRDI portal
Abstract: We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complexity of the algorithm and show its application in the formal analysis of a biological controller model.
Recommendations
Cites work
Cited in
(6)- Quantifier elimination for Henselian fields relative to additive and multiplicative congruences
- Elimination of constants from machines over algebraically closed fields
- QE software based on comprehensive Gröbner systems
- The number of Gröbner bases in finite fields (research)
- SMT solving over finite field arithmetic
- Quantifier elimination in linear difference equations over Witt vectors
This page was built for publication: Quantifier elimination over finite fields using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014937)