Groupwise density and related cardinals

Archive for Mathematical Logic 30 (1):1-11 (1990)
  Copy   BIBTEX

Abstract

We prove several theorems about the cardinal $\mathfrak{g}$ associated with groupwise density. With respect to a natural ordering of families of nond-ecreasing maps fromω toω, all families of size $< \mathfrak{g}$ are below all unbounded families. With respect to a natural ordering of filters onω, all filters generated by $< \mathfrak{g}$ sets are below all non-feeble filters. If $\mathfrak{u}< \mathfrak{g}$ then $\mathfrak{b}< \mathfrak{u}$ and $\mathfrak{g} = \mathfrak{d} = \mathfrak{c}$ . (The definitions of these cardinals are recalled in the introduction.) Finally, some consequences deduced from $\mathfrak{u}< \mathfrak{g}$ by Laflamme are shown to be equivalent to $\mathfrak{u}< \mathfrak{g}$

Links

PhilArchive



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

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

On some filters and ideals of the Medvedev lattice.Andrea Sorbi - 1990 - Archive for Mathematical Logic 30 (1):29-48.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
MAD families of projections on l2 and real-valued functions on ω.Tristan Bice - 2011 - Archive for Mathematical Logic 50 (7-8):791-801.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
Descriptor Revision.Sven Ove Hansson - 2014 - Studia Logica 102 (5):955-980.
The amalgamation spectrum.John T. Baldwin, Alexei Kolesnikov & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (3):914-928.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Weak partition properties on trees.Michael Hrušák, Petr Simon & Ondřej Zindulka - 2013 - Archive for Mathematical Logic 52 (5-6):543-567.

Analytics

Added to PP
2013-12-01

Downloads
36 (#421,132)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Forcing and stable ordered–union ultrafilters.Todd Eisworth - 2002 - Journal of Symbolic Logic 67 (1):449-464.
Combinatorics for the dominating and unsplitting numbers.Jason Aubrey - 2004 - Journal of Symbolic Logic 69 (2):482-498.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
Groupwise dense families.Heike Mildenberger - 2001 - Archive for Mathematical Logic 40 (2):93-112.

View all 8 citations / Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Near coherence of filters. I. Cofinal equivalence of models of arithmetic.Andreas Blass - 1986 - Notre Dame Journal of Formal Logic 27 (4):579-591.
Near coherence of filters. III. A simplified consistency proof.Andreas Blass & Saharon Shelah - 1989 - Notre Dame Journal of Formal Logic 30 (4):530-538.

Add more references