Abstract
A well ordered set1 is a poset
where ≤ U is a wellordering on Field(U), i.e. a linear (total) ordering on Field(U) such that every non-empty X ⊆ Field(U) has a least member. Associated with U is also its strict ordering < U ,
.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Moschovakis, Y.N. (1994). Well Ordered Sets. In: Notes on Set Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4153-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4153-7_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4155-1
Online ISBN: 978-1-4757-4153-7
eBook Packages: Springer Book Archive