Admissible ordering on monomials is well-founded: a constructive proof

DOI10.1134/s0361768823040102MaRDI QIDQ6094419

S. D. Meshveliani

Publication date: 13 September 2023

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

polynomialsDickson's lemmacomputer algebraconstructive proofadmissible ordering

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35) Other constructive mathematics (03F65) Formalization of mathematics in connection with theorem provers (68V20)

Cites Work

• Combinatory logic. With two sections by William Craig.
• A machine-checked implementation of Buchberger's algorithm
• Stop When You Are Almost-Full
• Dependently Typed Programming in Agda
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Admissible ordering on monomials is well-founded: a constructive proof