Lower bounds of sets of P-points
From MaRDI portal
Other combinatorial set theory (03E05) Other classical set theory (including functions, relations, and set algebra) (03E20) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Continuum hypothesis and Martin's axiom (03E50) Extensions of spaces (compactifications, supercompactifications, completions, etc.) (54D35) Special constructions of topological spaces (spaces of ultrafilters, etc.) (54D80)
Abstract: We show that implies that each collection of -points of size at most which has a -point as an upper bound also has a -point as an lower bound.
Recommendations
Cites work
- A long chain of P-points
- Chains of P-points
- Homogeneity problems in the theory of Cech compactifications
- scientific article; zbMATH DE number 1113072 (Why is no real title available?)
- scientific article; zbMATH DE number 3254655 (Why is no real title available?)
- On embedding certain partial orders into the P-points under Rudin-Keisler and Tukey reducibility
- Partial Orders on the Types in βN
- The intersection of nonstandard models of arithmetic
- The Rudin-Keisler Ordering of P-Points
- Ultrafilters and Independent Sets
This page was built for publication: Lower bounds of sets of P-points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187415)