Displaying similar documents to “Almost all submaximal groups are paracompact and σ-discrete”

Bohr compactifications of discrete structures

Joan Hart, Kenneth Kunen (1999)

Fundamenta Mathematicae

Similarity:

We prove the following theorem: Given a⊆ω and 1 ≤ α < ω 1 C K , if for some η < ℵ 1 and all u ∈ WO of length η, a is Σ α 0 ( u ) , then a is Σ α 0 .We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: Σ 1 1 -Turing-determinacy implies the existence of 0 .

Expansions of the real line by open sets: o-minimality and open cores

Chris Miller, Patrick Speissegger (1999)

Fundamenta Mathematicae

Similarity:

The open core of a structure ℜ := (ℝ,<,...) is defined to be the reduct (in the sense of definability) of ℜ generated by all of its definable open sets. If the open core of ℜ is o-minimal, then the topological closure of any definable set has finitely many connected components. We show that if every definable subset of ℝ is finite or uncountable, or if ℜ defines addition and multiplication and every definable open subset of ℝ has finitely many connected components, then the open core...

Partition properties of ω1 compatible with CH

Uri Abraham, Stevo Todorčević (1997)

Fundamenta Mathematicae

Similarity:

A combinatorial statement concerning ideals of countable subsets of ω is introduced and proved to be consistent with the Continuum Hypothesis. This statement implies the Suslin Hypothesis, that all (ω, ω*)-gaps are Hausdorff, and that every coherent sequence on ω either almost includes or is orthogonal to some uncountable subset of ω.

Embedding partially ordered sets into ω ω

Ilijas Farah (1996)

Fundamenta Mathematicae

Similarity:

We investigate some natural questions about the class of posets which can be embedded into ⟨ω,≤*⟩. Our main tool is a simple ccc forcing notion H E which generically embeds a given poset E into ⟨ω,≤*⟩ and does this in a “minimal” way (see Theorems 9.1, 10.1, 6.1 and 9.2).