Closed preordered set
In mathematics, a closed preordered set is one whose anti-well-ordered subsets have lower bounds.
Definition
Let be a cardinal. A preordered set is called -closed if every subset of 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 -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
- ^ a b Kunen, Kenneth (1980). Set theory: an introduction to independence proofs. Studies in Logic and the Foundations of Mathematics. Vol. 102. North-Holland. ISBN 978-0-444-86839-8. MR 0597342. Zbl 0534.03026.
- ^ Jech, Thomas (2003). Set theory. Springer Monographs in Mathematics (3 ed.). Berlin: Springer. doi:10.1007/3-540-44761-X. ISBN 978-3-540-44085-7. ISSN 1439-7382. MR 1940513. Zbl 1007.03002.
- ^ Kurilić, Miloš S. (2025). "Iterated reduced powers of collapsing algebras". Annals of Pure and Applied Logic. 176 (6): Paper No. 103567. doi:10.1016/j.apal.2025.103567. ISSN 0168-0072. MR 4874856. Zbl 08018530.
{{cite journal}}: CS1 maint: Zbl (link) - ^ Freire, Alfredo Roque; Williams, Kameryn J. (2025). "Non-tightness in class theory and second-order arithmetic". The Journal of Symbolic Logic. 90 (2): 627–654. arXiv:2212.04445. doi:10.1017/jsl.2023.38. ISSN 0022-4812. Zbl 08069454.
{{cite journal}}: CS1 maint: Zbl (link)