It is shown to be consistent that every function of first Baire class can be decomposed into continuous functions yet the least cardinal of a dominating family in is . The model used in the one obtained by adding Miller reals to a model of the Continuum Hypothesis.
A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them under subsets...
We investigate the relative consistency and independence of statements which imply the existence of various kinds of dense orders, including dense linear orders. We study as well the relationship between these statements and others involving partition properties. Since we work in ZF (i.e. without the Axiom of Choice), we also analyze the role that some weaker forms of AC play in this context
On a Hausdorff inverse Lindelöf non Lindelöf topology has been constructed.
It is consistent that but .
Suppose that κ is λ-supercompact witnessed by an elementary embedding j: V → M with critical point κ, and further suppose that F is a function from the class of regular cardinals to the class of cardinals satisfying the requirements of Easton’s theorem: (1) ∀α α < cf(F(α)), and (2) α < β ⇒ F(α) ≤ F(β). We address the question: assuming GCH, what additional assumptions are necessary on j and F if one wants to be able to force the continuum function to agree with F globally, while preserving...
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 for any regular κ. We use this theorem to show that for all κ, the assumption of 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. We use...
We investigate some natural questions about the class of posets which can be embedded into ⟨ω,≤*⟩. Our main tool is a simple ccc forcing notion 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).
Given a Boolean algebra 𝔹 and an embedding e:𝔹 → 𝓟(ℕ)/fin we consider the possibility of extending each or some automorphism of 𝔹 to the whole 𝓟(ℕ)/fin. Among other things, we show, assuming CH, that for a wide class of Boolean algebras there are embeddings for which no non-trivial automorphism can be extended.