The linear refinement number and selection theory

Michał Machura; Saharon Shelah; Boaz Tsaban

Displaying similar documents to “The linear refinement number and selection theory”

CH and the Sacks property

S. Quickert (2002)

Fundamenta Mathematicae

Similarity:

We show the consistency of CH and the statement “no ccc forcing has the Sacks property” and derive some consequences for ccc $ω^{ω}$ -bounding forcing notions.

Another ⋄-like principle

Michael Hrušák (2001)

Fundamenta Mathematicae

Similarity:

A new ⋄-like principle $⋄_{}$ consistent with the negation of the Continuum Hypothesis is introduced and studied. It is shown that $\neg ⋄_{}$ is consistent with CH and that in many models of = ω₁ the principle $⋄_{}$ holds. As $⋄_{}$ implies that there is a MAD family of size ℵ₁ this provides a partial answer to a question of J. Roitman who asked whether = ω₁ implies = ω₁. It is proved that $⋄_{}$ holds in any model obtained by adding a single Laver real, answering a question of J. Brendle who asked whether = ω₁...

On Dimensionsgrad, resolutions, and chainable continua

Michael G. Charalambous, Jerzy Krzempek (2010)

Fundamenta Mathematicae

Similarity:

For each natural number n ≥ 1 and each pair of ordinals α,β with n ≤ α ≤ β ≤ ω(⁺), where ω(⁺) is the first ordinal of cardinality ⁺, we construct a continuum $S_{n, α, β}$ such that (a) $d i m S_{n, α, β} = n$ ; (b) $t r D g S_{n, α, β} = t r D g o S_{n, α, β} = α$ ; (c) $t r i n d S_{n, α, β} = t r I n d ₀ S_{n, α, β} = β$ ; (d) if β < ω(⁺), then $S_{n, α, β}$ is separable and first countable; (e) if n = 1, then $S_{n, α, β}$ can be made chainable or hereditarily decomposable; (f) if α = β < ω(⁺), then $S_{n, α, β}$ can be made hereditarily indecomposable; (g) if n = 1 and α = β < ω(⁺), then $S_{n, α, β}$ can be made chainable and hereditarily indecomposable. In...

Reflecting character and pseudocharacter

Lucia R. Junqueira, Alberto M. E. Levi (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We say that a cardinal function $φ$ reflects an infinite cardinal $κ$ , if given a topological space $X$ with $φ (X) \geq κ$ , there exists $Y \in {[X]}^{\leq κ}$ with $φ (Y) \geq κ$ . We investigate some problems, discussed by Hodel and Vaughan in Reflection theorems for cardinal functions, Topology Appl. 100 (2000), 47–66, and Juhász in Cardinal functions and reflection, Topology Atlas Preprint no. 445, 2000, related to the reflection for the cardinal functions character and pseudocharacter. Among other results, we present some new equivalences...

Initially $κ$ -compact spaces for large $κ$

Stavros Christodoulou (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This work presents some cardinal inequalities in which appears the closed pseudo-character, $ψ_{c}$ , of a space. Using one of them — $ψ_{c} (X) \leq 2^{d (X)}$ for $T_{2}$ spaces — we improve, from $T_{3}$ to $T_{2}$ spaces, the well-known result that initially $κ$ -compact $T_{3}$ spaces are $λ$ -bounded for all cardinals $λ$ such that $2^{λ} \leq κ$ . And then, using an idea of A. Dow, we prove that initially $κ$ -compact $T_{2}$ spaces are in fact compact for $κ = 2^{F (X)}$ , $2^{s (X)}$ , $2^{t (X)}$ , $2^{χ (X)}$ , $2^{ψ_{c} (X)}$ or $κ = max {τ^{+}, τ^{< τ}}$ , where $τ > t (p, X)$ for all $p \in X$ .

On the bounding, splitting, and distributivity numbers

Alan S. Dow, Saharon Shelah (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The cardinal invariants $𝔥, 𝔟, 𝔰$ of $𝒫 (ω)$ are known to satisfy that $ω_{1} \leq 𝔥 \leq min {𝔟, 𝔰}$ . We prove that all inequalities can be strict. We also introduce a new upper bound for $𝔥$ and show that it can be less than $𝔰$ . The key method is to utilize finite support matrix iterations of ccc posets following paper Ultrafilters with small generating sets by A. Blass and S. Shelah (1989).

Combinatorics of open covers (VII): Groupability

Ljubiša D. R. Kočinac, Marion Scheepers (2003)

Fundamenta Mathematicae

Similarity:

We use Ramseyan partition relations to characterize: ∙ the classical covering property of Hurewicz; ∙ the covering property of Gerlits and Nagy; ∙ the combinatorial cardinal numbers and add(ℳ ). Let X be a $T_{31 / 2}$ -space. In [9] we showed that $C_{p} (X)$ has countable strong fan tightness as well as the Reznichenko property if, and only if, all finite powers of X have the Gerlits-Nagy covering property. Now we show that the following are equivalent: 1. $C_{p} (X)$ has countable fan tightness and the Reznichenko...

On families of Lindelöf and related subspaces of $2^{ω ₁}$

Lúcia Junqueira, Piotr Koszmider (2001)

Fundamenta Mathematicae

Similarity:

We consider the families of all subspaces of size ω₁ of $2^{ω ₁}$ (or of a compact zero-dimensional space X of weight ω₁ in general) which are normal, have the Lindelöf property or are closed under limits of convergent ω₁-sequences. Various relations among these families modulo the club filter in ${[X]}^{ω ₁}$ are shown to be consistently possible. One of the main tools is dealing with a subspace of the form X ∩ M for an elementary submodel M of size ω₁. Various results with this flavor are obtained. Another...

A solution to Comfort's question on the countable compactness of powers of a topological group

Artur Hideyuki Tomita (2005)

Fundamenta Mathematicae

Similarity:

In 1990, Comfort asked Question 477 in the survey book “Open Problems in Topology”: Is there, for every (not necessarily infinite) cardinal number $α \leq 2^{}$ , a topological group G such that $G^{γ}$ is countably compact for all cardinals γ < α, but $G^{α}$ is not countably compact? Hart and van Mill showed in 1991 that α = 2 answers this question affirmatively under $M A_{c o u n t a b l e}$ . Recently, Tomita showed that every finite cardinal answers Comfort’s question in the affirmative, also from $M A_{c o u n t a b l e}$ . However, the question has...

Uncountable cardinals have the same monadic ∀₁¹ positive theory over large sets

Athanassios Tzouvaras (2004)

Fundamenta Mathematicae

Similarity:

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures $(2^{κ}, {[2^{κ}]}^{> κ}, <)$ , $(2^{λ}, {[2^{λ}]}^{> λ}, <)$ are...

Embedding orders into the cardinals with $D C_{κ}$

Asaf Karagila (2014)

Fundamenta Mathematicae

Similarity:

Jech proved that every partially ordered set can be embedded into the cardinals of some model of ZF. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $Z F + D C_{< κ}$ for any regular κ. We use this theorem to show that for all κ, the assumption of $D C_{κ}$ does not entail that there are no decreasing chains of cardinals. We also show how to extend the result to and embed into the cardinals a proper class which is definable over the ground model....

The covering number for category and partition relations on $P_{ω} (λ)$

Pierre Matet (2002)

Fundamenta Mathematicae

Similarity:

We show that cov(M) is the least infinite cardinal λ such that $P_{ω} (λ)$ (the set of all finite subsets of λ ) fails to satisfy a certain natural generalization of Ramsey’s Theorem.

A partition property of cardinal numbers

N. H. Williams

Similarity:

CONTENTSIntroduction....................................................................................... 5§ 1. Notation and definitions......................................................... 5§ 2. Negative relations.................................................................... 9§ 3. The Ramification Lemma ..................................................... 10§ 4. The main theorem................................................................... 13§ 5. A result for cardinals...

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

Similarity:

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence $ϕ_{ℳ}$ if $ϕ_{ℳ}$ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if $ℵ_{β}$ is characterized by a Scott sentence, then $2^{ℵ_{β + β ₁}}$ is (homogeneously) characterized by a Scott sentence, for all 0 <...

On ordinals accessible by infinitary languages

Saharon Shelah, Pauli Väisänen, Jouko Väänänen (2005)

Fundamenta Mathematicae

Similarity:

Let λ be an infinite cardinal number. The ordinal number δ(λ) is the least ordinal γ such that if ϕ is any sentence of $L_{λ ⁺ ω}$ , with a unary predicate D and a binary predicate ≺, and ϕ has a model ℳ with $⟨ D^{ℳ}, ≺^{ℳ} ⟩$ a well-ordering of type ≥ γ, then ϕ has a model ℳ ’ where $⟨ D^{ℳ^{'}}, ≺^{ℳ^{'}} ⟩$ is non-well-ordered. One of the interesting properties of this number is that the Hanf number of $L_{λ ⁺ ω}$ is exactly $ℶ_{δ (λ)}$ . It was proved in [BK71] that if ℵ₀ < λ < κ $a r e r e g u l a r c a r d i n a l n u m b e r s, t h e n t h e r e i s a f o r c i n g e x t e n s i o n, p r e s e r v i n g c o f i n a l i t i e s, s u c h t h a t i n t h e e x t e n s i o n$ 2λ = κ $a n d δ (λ) < λ ⁺ ⁺ . W e i m p r o v e t h i s r e s u l t b y p r o v i n g t h e f o l l o w i n g : S u p p o s e ℵ ₀ < λ < θ \leq κ a r e c a r d i n a l n u m b e r s s u c h t h a t$ ∙ $λ^{< λ} = λ$ ; ∙ cf(θ) ≥ λ⁺ and $μ^{λ} < θ$ whenever μ < θ; ∙ $κ^{λ} = κ$ . Then there...

Locally Σ₁-definable well-orders of H(κ⁺)

Peter Holy, Philipp Lücke (2014)

Fundamenta Mathematicae

Similarity:

Given an uncountable cardinal κ with $κ = κ^{< κ}$ and $2^{κ}$ regular, we show that there is a forcing that preserves cofinalities less than or equal to $2^{κ}$ and forces the existence of a well-order of H(κ⁺) that is definable over ⟨H(κ⁺),∈⟩ by a Σ₁-formula with parameters. This shows that, in contrast to the case "κ = ω", the existence of a locally definable well-order of H(κ⁺) of low complexity is consistent with failures of the GCH at κ. We also show that the forcing mentioned above introduces a Bernstein...