Covering the Baire space by families which are not finitely dominating

Annals of Pure and Applied Logic 140 (1):60-71 (2006)
  Copy   BIBTEX

Abstract

It is consistent that each union of many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter , the cofinality of the reduced ultrapower is greater than . The model is constructed by oracle chain condition forcing, to which we give a self-contained introduction

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,733

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

Dominating projective sets in the Baire space.Otmar Spinas - 1994 - Annals of Pure and Applied Logic 68 (3):327-342.
Combinatorics for the dominating and unsplitting numbers.Jason Aubrey - 2004 - Journal of Symbolic Logic 69 (2):482-498.
Regularity properties for dominating projective sets.Jörg Brendle, Greg Hjorth & Otmar Spinas - 1995 - Annals of Pure and Applied Logic 72 (3):291-307.
Bounding and Dominating Number of Families of Functions on ω.Claude Laflamme - 1994 - Mathematical Logic Quarterly 40 (2):207-223.
Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.
Covering properties of $$omega $$ω -mad families.Leandro Aurichi & Lyubomyr Zdomskyy - 2020 - Archive for Mathematical Logic 59 (3-4):445-452.
Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.

Analytics

Added to PP
2013-12-31

Downloads
25 (#871,645)

6 months
14 (#218,995)

Historical graph of downloads
How can I increase my downloads?