Kleene's O
Summary
In set theory and computability theory, Kleene's is a canonical subset of the natural numbers when regarded as ordinal notations. It contains ordinal notations for every computable ordinal, that is, ordinals below Church–Kleene ordinal, . Since is the first ordinal not representable in a computable system of ordinal notations the elements of can be regarded as the canonical ordinal notations.
Further reading
- Wikipedia, page 16105044, revision 1316619015, Kleene's O. adopted
About this page
| Tag | WHAP0K600D |
|---|---|
| URI | m2://WHAP0K600D |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.