scientific article; zbMATH DE number 3930347
From MaRDI portal
Publication:3703293
finitely presented boolean polynomial ringsfinitely presented commutative ringGröbner basislinear formspolynomial equivalence problempolynomial idealsterm rewritingunifiers of two forms over a finitely presented abelian group
Word problems, etc. in computability and recursion theory (03D40) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Applications of logic to commutative algebra (13L05) Symbolic computation and algebraic computation (68W30)
Recommendations
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- scientific article; zbMATH DE number 3930337
- scientific article; zbMATH DE number 3870585
- Gröbner and Gröbner-Shirshov bases in algebra: an elementary approach.
- An algebraic approach to unification under associativity and commutativity
Cited in
(17)- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Buchberger's algorithm: The term rewriter's point of view
- Conditional congruence closure over uninterpreted and interpreted symbols
- Cancellativity in finitely presented semigroups
- Solving non-linear Boolean equation systems by variable elimination
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Deciding the word problem for ground identities with commutative and extensional symbols
- Incremental column-wise verification of arithmetic circuits using computer algebra
- On the complexity of Boolean unification
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- The ``freedom theorem for left-commutative algebras
- Simulating Buchberger's algorithm by Knuth-Bendix completion
- Boolean Gröbner bases
- Complexity of unification problems with associative-commutative operators
- Congruence closure modulo groups
- The complexity of equivalence for commutative rings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703293)
