Definitionadvanced
CTL*
Also called Full computation tree logic.
Branching-time logic combining arbitrary LTL path formulas with path quantifiers.
Branching-time logic combining arbitrary LTL path formulas with path quantifiers.
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 NNARR0 Edit this page History Report an error