Theoremresearch
Post's theorem
Also called Post's theorem on the arithmetical hierarchy.
A set is Σ(n+1) arithmetical iff it is recursively enumerable in the nth Turing jump.
A set is Σ(n+1) arithmetical iff it is recursively enumerable in the nth Turing jump.
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 BGPJ7S Edit this page History Report an error