Lower bounds of sets of P-points
DOI10.1215/00294527-2023-0009arXiv2204.12203OpenAlexW4387260753MaRDI QIDQ6187415
Dilip Raghavan, Boriša Kuzeljević, Jonathan L. Verner
Publication date: 15 January 2024
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12203
Consistency and independence results (03E35) Extensions of spaces (compactifications, supercompactifications, completions, etc.) (54D35) Continuum hypothesis and Martin's axiom (03E50) Other combinatorial set theory (03E05) Special constructions of topological spaces (spaces of ultrafilters, etc.) (54D80) Other classical set theory (including functions, relations, and set algebra) (03E20) Other aspects of forcing and Boolean-valued models (03E40)
Cites Work
- Unnamed Item
- Unnamed Item
- Homogeneity problems in the theory of Cech compactifications
- On embedding certain partial orders into the P-points under Rudin-Keisler and Tukey reducibility
- A long chain of P-points
- Chains of P-points
- Partial Orders on the Types in βN
- The intersection of nonstandard models of arithmetic
- Ultrafilters and Independent Sets
- The Rudin-Keisler Ordering of P-Points
This page was built for publication: Lower bounds of sets of P-points
