Simple word problems in universal algebras.¶
Knuth, D. E., & Bendix, P. B. (1970). Simple word problems in universal algebras. Computational Problems in Abstract Algebra.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Well-Foundedness (Well-Ordering)
- … (Knuth-Bendix ordering, lexicographic path ordering, recursive path ordering, multiset orderings, matrix interpretations, size-change termination) has developed around the engineering of well-founded measures, with Knuth & Bendix (1970) supplying the foundational completion procedure and reduction-ordering framework.
This sourceKnuth-Bendix completion procedure and reduction-ordering framework for term-rewriting termination.
- … (Knuth-Bendix ordering, lexicographic path ordering, recursive path ordering, multiset orderings, matrix interpretations, size-change termination) has developed around the engineering of well-founded measures, with Knuth & Bendix (1970) supplying the foundational completion procedure and reduction-ordering framework.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a10585c050e3 · see in the full table