Definitionintro
Monotone predicate
Also called monotone feasibility predicate, monotone decision predicate.
A yes/no property that flips from false to true exactly once over an ordered domain, which makes binary search valid.
A yes/no property that flips from false to true exactly once over an ordered domain, which makes binary search valid.
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 A23CGW Edit this page History Report an error