Document Type

Article

Publication Date

1981

Publication Source

Proceedings of the Edinburgh Mathematical Society

Abstract

A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the least upper bound of C, denoted by sup C, exists. Notice that C could be empty, so an ω-chain complete partially ordered set has a least element, denoted by 0.

Inclusive pages

141-146

ISBN/ISSN

0013-0915

Document Version

Postprint

Comments

The item available for download is the author's accepted manuscript; the proceedings article of record is available online. Some differences may exist between this version and the published version; as such, researchers wishing to quote directly from this source are advised to consult the version of record.

Permission documentation is on file.

Publisher

Edinburgh Mathematical Society

Volume

24

Volume

24

Peer Reviewed

yes

Link to published version

Share

COinS