A critical-pair/completion algorithm for finitely generated ideals in rings

This publication has 16 references indexed in Scilit:

• Algebraic Simplification
  Published by Springer Nature ,1982
• New decision algorithms for finitely presented commutative semigroups
  Computers & Mathematics with Applications, 1981
• A criterion for detecting unnecessary reductions in the construction of Gröbner-bases
  Published by Springer Nature ,1979
• The diamond lemma for ring theory
  Advances in Mathematics, 1978
• The role of algorithms in the teaching of algebra
  Published by Springer Nature ,1978
• Some properties of Gröbner-bases for polynomial ideals
  ACM SIGSAM Bulletin, 1976
• A theoretical basis for the reduction of polynomials to canonical forms
  ACM SIGSAM Bulletin, 1976
• Constructive aspects of Noetherian rings
  Proceedings of the American Mathematical Society, 1974
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
  Aequationes mathematicae, 1970
• The solution of a decision problem for several classes of rings
  Pacific Journal of Mathematics, 1970