Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T22:11:35.523Z Has data issue: false hasContentIssue false

Combinatorics for the dominating and unsplitting numbers

Published online by Cambridge University Press:  12 March 2014

Jason Aubrey*
Affiliation:
Department of Mathematics, University of Northern Iowa, Cedar Falls, IA 50614-0506, USA, E-mail: aubreyj@math.uni.edu

Abstract.

In this paper we introduce a new property of families of functions on the Baire space, called pseudo-dominating, and apply the properties of these families to the study of cardinal characteristics of the continuum. We show that the minimum cardinality of a pseudo-dominating family is min {τ, ∂}. We derive two corollaries from the proof: τ ≥ min{∂, u} and min{∂, τ} = min{∂, τσ}. We show that if a dominating family is partitioned into fewer that s pieces, then one of the pieces is pseudo-dominating. We finally show that u < g implies that every unbounded family of functions is pseudo-dominating, and that the Filter Dichotomy principle is equivalent to every unbounded family of functions being finitely pseudo-dominating.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable