Techniqueadvanced
Ackermannization
Also called Ackermann reduction, Ackermann's reduction.
Eliminate uninterpreted functions by adding functional-consistency constraints between their applications.
Eliminate uninterpreted functions by adding functional-consistency constraints between their applications.
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 RJ452K Edit this page History Report an error