Ordinal notation system: Difference between revisions
Jump to navigation
Jump to search
Content added Content deleted
(Created page with "An '''ordinal notation system''' (also called an '''ordinal notation''' informally) is a system of names for ordinals, or equivalently, a well-ordered set of objects that "can be considered names". There may not be a formal restriction of what objects can be considered names, but most common examples include strings, sequences, trees/hydras, and terms built up from constants and functions. Most authors also require the well-order to be recursive, and this requirement is...") |
mNo edit summary |
||
Line 3:
Notable ordinal notation systems include:
- [[Cantor
- [[Primitive sequence system]]
|
Revision as of 22:12, 10 July 2023
An ordinal notation system (also called an ordinal notation informally) is a system of names for ordinals, or equivalently, a well-ordered set of objects that "can be considered names". There may not be a formal restriction of what objects can be considered names, but most common examples include strings, sequences, trees/hydras, and terms built up from constants and functions. Most authors also require the well-order to be recursive, and this requirement is included in the definition of proof-theoretic ordinals that uses ordinal notation systems.
Notable ordinal notation systems include:
- ordinal notation systems associated to ordinal collapsing functions
- Taranovsky's ordinal notations
- Y sequence (as long as it is well-ordered)