Lower Bounds of Sets of P-points

Notre Dame Journal of Formal Logic 64 (3):317-327 (2023)
  Copy   BIBTEX

Abstract

We show that MAκ implies that each collection of Pc-points of size at most κ which has a Pc-point as an RK upper bound also has a Pc-point as an RK lower bound.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,716

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

Analytics

Added to PP
2023-10-04

Downloads
21 (#1,109,105)

6 months
8 (#526,964)

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

A long chain of P-points.Borisa Kuzeljevic & Dilip Raghavan - 2018 - Journal of Mathematical Logic 18 (1):1850004.
The intersection of nonstandard models of arithmetic.Andreas Blass - 1972 - Journal of Symbolic Logic 37 (1):103-106.

Add more references