Techniqueresearch
Dependency pairs
Also called dependency pair framework, DP method.
A modular framework that proves termination by ordering pairs of defined symbols.
A modular framework that proves termination by ordering pairs of defined symbols.
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 N6FNJ0 Edit this page History Report an error