Abstract typeintro
Tree
Also called rooted tree, free tree.
Connected acyclic graph, rooted or free, as an abstract type.
Connected acyclic graph, rooted or free, as an abstract type.
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 PHJCS4 Edit this page History Report an error