Department of Mathematics and Statistics,; University of Canterbury

SVM HeaderParse 0.2

AUTHOR ADDR

Christchurch, New Zealand

SVM HeaderParse 0.2

ABSTRACT

Partially ordered sets are investigated from the point of view of Bishop’s constructive mathematics. Unlike the classical case, one cannot prove constructively that every nonempty bounded above set of real numbers has a supremum. However, the order completeness of R is expressed constructively by an equivalent condition for the existence of the supremum, a condition of (upper) order locatedness which is vacuously true in the classical case. A generalization of this condition will provide a definition of upper locatedness for a partially ordered set. It turns out that the supremum of a set S exists if and only if S is upper located and has a weak supremum—that is, the classical least upper bound. A partially ordered set will be called order complete if each nonempty subset that is bounded above and upper located has a supremum. It can be proved that, as in the classical mathematics, R n is order complete. 1