Ordinal notation system: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

25 March 2024

11 July 2023

10 July 2023

  • curprev 22:1222:12, 10 July 2023‎ Yto talk contribs‎ m 918 bytes −2‎ No edit summary undo
  • curprev 22:1122:11, 10 July 2023‎ Yto talk contribs‎ 920 bytes +920‎ 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..."
Retrieved from "https://apeirology.com/wiki/Ordinal_notation_system"