2003
DOI: 10.1515/jaa.2003.149
|View full text |Cite
|
Sign up to set email alerts
|

Critical Cardinalities and Additivity Properties of Combinatorial Notions of Smallness

Abstract: Abstract. Motivated by the minimal tower problem, an earlier work studied diagonalizations of covers where the covers are related to linear quasiorders (τ -covers). We deal with two types of combinatorial questions which arise from this study.(1) Two new cardinals introduced in the topological study are expressed in terms of well known cardinals characteristics of the continuum. (2) We study the additivity numbers of the combinatorial notions corresponding to the topological diagonalization notions. This gives… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
19
0

Year Published

2004
2004
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(20 citation statements)
references
References 13 publications
1
19
0
Order By: Relevance
“…Solving a longstanding problem, Malliaris and the second named author have recently proved that p = t [6]. We prove that, consistently, p < lr < c. This settles [16, Problem 64] (quoted in [15,Problem 5] and in [17,Problem 11.2 (311)]). Moreover, we have that lr = d in all models of set theory where the continuum is at most ℵ 2 .…”
Section: Overviewsupporting
confidence: 65%
See 1 more Smart Citation
“…Solving a longstanding problem, Malliaris and the second named author have recently proved that p = t [6]. We prove that, consistently, p < lr < c. This settles [16, Problem 64] (quoted in [15,Problem 5] and in [17,Problem 11.2 (311)]). Moreover, we have that lr = d in all models of set theory where the continuum is at most ℵ 2 .…”
Section: Overviewsupporting
confidence: 65%
“…It is known that lr ≤ lx ≤ d [16] and that b, s ≤ lx [15]. In particular, by the abovementioned result on lr, we have that lx = d whenever the continuum is at most ℵ 2 .…”
Section: Overviewmentioning
confidence: 72%
“…add(X, D) is the minimal cardinality κ of a dominating Y ⊆ N N such that for each partition of Y into κ many pieces, there is a piece such that no g avoids middles in that piece. This cardinal is studied in [59]. Problem 11.5 ([59]).…”
Section: Cardinal Characteristics Of the Continuummentioning
confidence: 99%
“…An element U ∈ O(X) is in T(X) if every member of X is a member of infinitely many elements of U, and, for all x, y ∈ X, either x ∈ U implies y ∈ U for all but finitely many U ∈ U, or y ∈ U implies x ∈ U for all but finitely many U ∈ U. Figure 2 contains all new properties introduced by the inclusion of T into the framework, together with their critical cardinalities [42,39,21,20], and a serial number to be used below. Proof.…”
Section: Applicationsmentioning
confidence: 99%