Generic existence of interval P-points

Archive for Mathematical Logic 62 (5):619-640 (2023)
  Copy   BIBTEX

Abstract

A P-point ultrafilter over \(\omega \) is called an interval P-point if for every function from \(\omega \) to \(\omega \) there exists a set _A_ in this ultrafilter such that the restriction of the function to _A_ is either a constant function or an interval-to-one function. In this paper we prove the following results. (1) Interval P-points are not isomorphism invariant under \(\textsf{CH}\) or \(\textsf{MA}\). (2) We identify a cardinal invariant \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})\) such that every filter base of size less than continuum can be extended to an interval P-point if and only if \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})={\mathfrak {c}}\). (3) We prove the generic existence of slow/rapid non-interval P-points and slow/rapid interval P-points which are neither quasi-selective nor weakly Ramsey under the assumption \({\mathfrak {d}}={\mathfrak {c}}\) or \(\textbf{cov}({\mathcal {B}})={\mathfrak {c}}\).

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Constructing local optima on a compact interval.Douglas S. Bridges - 2007 - Archive for Mathematical Logic 46 (2):149-154.
C-Quasi-Minimal enumeration degrees below c'.Boris Solon - 2006 - Archive for Mathematical Logic 45 (4):505-517.
Forcing and antifoundation.Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):645-661.
Shelah’s work on non-semi-proper iterations, I.Chaz Schlindwein - 2008 - Archive for Mathematical Logic 47 (6):579-606.
Free Łukasiewicz implication algebras.José Díaz Varela - 2008 - Archive for Mathematical Logic 47 (1):25-33.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.

Analytics

Added to PP
2022-12-01

Downloads
9 (#1,253,837)

6 months
6 (#520,848)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Ultrafilters on a countable set.David Booth - 1970 - Annals of Mathematical Logic 2 (1):1.
Ultrafilters on ω.James E. Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):624-639.
Ultrafilters on $omega$.James E. Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):624-639.
Slow p-point ultrafilters.Renling Jin - 2020 - Journal of Symbolic Logic 85 (1):26-36.

View all 6 references / Add more references