Closed preordered set

From HandWiki

In mathematics, a closed preordered set is one whose anti-well-ordered subsets have lower bounds.

Definition

Let κ be a cardinal. A preordered set (P,) is called κ-closed if every subset of P whose opposite is well-ordered with order-type less than κ has a lower bound.[1]: 214, Definition VII.6.12 [2]: Definition 15.7 [3]: §2 

A preordered set is <κ-closed if it is λ-closed for every λ<κ. A preordered set is called closed or <Ord-closed if it is κ-closed for every κ.[4]: Lemma 4.0.10 

A preordered set is inductive if every chain has an upper bound. Since every totally ordered set has a well-ordered cofinal subset, this is equivalent to saying that the preordered set is the opposite of a closed preordered set.

Properties

Inductive preordered sets satisfy Zorn's lemma and the Bourbaki–Witt theorem.

A κ-closed forcing preserves cofinalities less than or equal to κ, hence cardinals less than or equal to κ.[1]: 215, Corollary 2.6.15 

References

  1. 1.0 1.1 Kunen, Kenneth (1980) (in en). Set theory: an introduction to independence proofs. Studies in Logic and the Foundations of Mathematics. 102. North-Holland. ISBN 978-0-444-86839-8. 
  2. Jech, Thomas (2003) (in en). Set theory. Springer Monographs in Mathematics (3 ed.). Berlin: Springer. doi:10.1007/3-540-44761-X. ISBN 978-3-540-44085-7. 
  3. Kurilić, Miloš S. (2025). "Iterated reduced powers of collapsing algebras" (in en). Annals of Pure and Applied Logic 176 (6): Paper No. 103567. doi:10.1016/j.apal.2025.103567. ISSN 0168-0072. 
  4. Freire, Alfredo Roque; Williams, Kameryn J. (2025). "Non-tightness in class theory and second-order arithmetic" (in en). The Journal of Symbolic Logic 90 (2): 627–654. doi:10.1017/jsl.2023.38. ISSN 0022-4812.