Prefer a chat interface with context about you and your work?
Natural Partial Orders
Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = { w: w < n } is called natural if x P y implies x ⩽ y . A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural …