Theoremadvanced
Orthogonal systems are confluent
Also called Huet's orthogonality theorem.
Every orthogonal term rewriting system is confluent.
Every orthogonal term rewriting system is confluent.
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 0FCP7R Edit this page History Report an error