Algorithmresearch
Unfailing completion
Also called unfailing Knuth-Bendix, Bachmair-Dershowitz-Hsiang completion.
Completion that works on equations without orienting them first.
Completion that works on equations without orienting them first.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag FECHPF Edit this page History Report an error