Adjoining dominating functions

&
Journal of Symbolic Logic 50 (1):94-101 (1985)
  Copy   BIBTEX

Abstract

If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every well-ordered unbounded family of increasing functions is a scale, and the splitting number s (and hence the distributivity number h) remains at ω 1

Categories

Keywords

Reprint years

DOI

10.2307/2273792

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,894

External links

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

Through your library

My notes

Similar books and articles

James E. Baumgartner. Sacks forcing and the total failure of Martin's axiom. Topology and its applications, vol. 19 , pp. 211–225. - James E. Baumgartner and Peter Dordal. Adjoining dominating functions. The journal of symbolic logic, vol. 50 , pp. 94–101. [REVIEW]Alan Dow - 2000 - Bulletin of Symbolic Logic 6 (4):495-497.
Cardinal Invariants and the Collapse of the Continuum by Sacks Forcing.Miroslav Repický - 2008 - Journal of Symbolic Logic 73 (2):711 - 727.
Bounding and Dominating Number of Families of Functions on ω.Claude Laflamme - 1994 - Mathematical Logic Quarterly 40 (2):207-223.
More canonical forms and dense free subsets.Heike Mildenberger - 2004 - Annals of Pure and Applied Logic 125 (1-3):75-99.
The cardinal coefficients of the Ideal If{{\mathcal {I}}_{f}}.Noboru Osuga & Shizuo Kamo - 2008 - Archive for Mathematical Logic 47 (7-8):653-671.
A model in which the base-matrix tree cannot have cofinal branches.Peter Lars Dordal - 1987 - Journal of Symbolic Logic 52 (3):651-664.
Partition numbers.Otmar Spinas - 1997 - Annals of Pure and Applied Logic 90 (1-3):243-262.
Dominating and unbounded free sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.
Hechler reals.Grzegorz Łabędzki & Miroslav Repický - 1995 - Journal of Symbolic Logic 60 (2):444-458.
Towers, mad families, and unboundedness.Vera Fischer, Marlene Koelbing & Wolfgang Wohofsky - 2023 - Archive for Mathematical Logic 62 (5):811-830.

Analytics

Added to PP
2009-01-28

Downloads
46 (#541,692)

6 months
1 (#1,601,934)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Mad families, splitting families and large continuum.Jörg Brendle & Vera Fischer - 2011 - Journal of Symbolic Logic 76 (1):198 - 208.
Forcing indestructibility of MAD families.Jörg Brendle & Shunsuke Yatabe - 2005 - Annals of Pure and Applied Logic 132 (2):271-312.
Splittings.A. Kamburelis & B. W’Glorz - 1996 - Archive for Mathematical Logic 35 (4):263-277.

View all 21 citations / Add more citations

References found in this work

Add more references