Proving well-orderedness: 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.

26 March 2024

25 March 2024

11 July 2023

  • curprev 20:2520:25, 11 July 2023‎ Yto talk contribs‎ m 2,495 bytes +6‎ No edit summary undo
  • curprev 20:2020:20, 11 July 2023‎ Yto talk contribs‎ 2,489 bytes +2,489‎ Created page with "Proving that an ordered set is well-ordered can be very challenging. The methods that can be used to do this vary depending on the type of ordered set. There are of course cases when none of this applies, but mainly in the context of pure apeirology, it often does apply. <h1>Proving totality</h1> As one of the two conditions for an order to be a well-order is that it is a total order, proving totality is a significant part of the proof of well-orderedness. In arbitraril..."
Retrieved from "https://apeirology.com/wiki/Proving_well-orderedness"