Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T04:50:00.339Z Has data issue: false hasContentIssue false

Natural Partial Orders

Published online by Cambridge University Press:  20 November 2018

R. A. Dean
Affiliation:
California Institute of Technology, Pasadena, California
Gordon Keller
Affiliation:
California Institute of Technology, Pasadena, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering. This is a consequence of the theorem of Szpielrajn (5) which states that every partial ordering of a set may be refined to a total ordering. In this paper we consider only natural partial orderings. In the first section we obtain theorems about the lattice of all NPO's of T(n).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968