Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem

DOI10.1016/S0747-7171(08)80154-XzbMath0755.13011MaRDI QIDQ1186713

Clas Löfwall, Carl Jacobsson

Publication date: 28 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithm for computing standard basesconstructively noetherian ring

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative Noetherian rings and modules (13E05)

Related Items (8)

Effective computation of the integral closure of a morphism ⋮ The Ascending Tree Condition: Constructive Algebra Without Countable Choice ⋮ Strongly Noetherian rings and constructive ideal theory ⋮ A constructive picture of Noetherian conditions and well quasi-orders ⋮ A constructive notion of codimension ⋮ Constructing Gröbner bases for Noetherian rings ⋮ Noetherian orders ⋮ Syntax for Semantics: Krull’s Maximal Ideal Theorem

Cites Work

• Lifting canonical algorithms from a ring R to the ring R[x]
• A course in constructive algebra
• Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
• Anneaux et modules cohérents
• What is Noetherian?
• Constructive Aspects of Noetherian Rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem