Math 2.0

Order, lattices, ordered algebraic structures Well-orders, well-founded orders, well-quasi-orders Concept

Successor order

Summary

A successor order is a partial order with a successor map. This map sends each non-maximal element to the least element strictly above it. It abstracts the successor function n↦n+1n \mapsto n + 1 on the natural numbers. The natural numbers, the integers, and every well-ordered set carry a successor order, while the rationals do not.

Further reading

  1. Web https://en.wikipedia.org/wiki/Successor_function
About this page
TagNT44831EFE
URIm2://NT44831EFE
Kindconcept
WritingW0 stub
MSC06A06, 06A05
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions