Given a regular uncountable cardinal κ and a cardinal λ > κ of cofinality ω, we show that the restriction of the non-stationary ideal on Pκ to the set of all a with equation image is not λ++-saturated . We actually prove the stronger result that there is equation image with |Q| = λ++ such that A∩B is a non-cofinal subset of Pκ for any two distinct members A, B of Q, where NGκ, λ denotes the game ideal on Pκ. (...) We also remark that for κ > ω1, adding λ+3 Cohen subsets of ω1 to equation image makes NGκ, λ λ+3-saturated. (shrink)

We discuss dividing lines (in model theory) and some test questions, mainly the universality spectrum. So there is much on conjectures, problems and old results, mainly of the author and also on some recent results.

The main notion dealt with in this article is where A is a Boolean algebra. A partition of 1 is a family ofnonzero pairwise disjoint elements with sum 1. One of the main reasons for interest in this notion is from investigations about maximal almost disjoint families of subsets of sets X, especially X=ω. We begin the paper with a few results about this set-theoretical notion.Some of the main results of the paper are:• (1) If there is a maximal family (...) of size λ≥κ of pairwise almost disjoint subsets of κ each of size κ, then there is a maximal family of size λ of pairwise almost disjoint subsets of κ+ each of size κ.• (2) A characterization of the class of all cardinalities of partitions of 1 in a product in terms of such classes for the factors; and a similar characterization for weak products.• (3) A cardinal number characterization of sets of cardinals with a largest element which are for some BA the set of all cardinalities of partitions of 1 of that BA.• (4) A computation of the set of cardinalities of partitions of 1 in a free product of finite-cofinite algebras. (shrink)

$(X_\alpha: \alpha is a strong chain in ℘(ω 1 )/Fin if and only if X β - X α is finite and X α - X β is uncountable for each $\beta . We show that it is consistent that a strong chain in ℘(ω 1 ) exists. On the other hand we show that it is consistent that there is a strongly almost-disjoint family in ℘(ω 1 ) but no strong chain exists: □ ω 1 is used to construct (...) a c.c.c forcing that adds a strong chain and Chang's Conjecture to prove that there is no strong chain. (shrink)

Let κ B be the least cardinal for which the Baire category theorem fails for the real line R. Thus κ B is the least κ such that the real line can be covered by κ many nowhere dense sets. It is shown that κ B cannot have countable cofinality. On the other hand it is consistent that the corresponding cardinal for 2 ω 1 be ℵ ω . Similar questions are considered for the ideal of measure zero sets, other (...) ω 1 saturated ideals, and the ideal of zero-dimensional subsets of R ω 1. (shrink)

If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered.

We prove that for every singular cardinal μ of cofinality ω, the complete Boolean algebra contains a complete subalgebra which is isomorphic to the collapse algebra CompCol. Consequently, adding a generic filter to the quotient algebra collapses μ0 to 1. Another corollary is that the Baire number of the space U of all uniform ultrafilters over μ is equal to ω2. The corollaries affirm two conjectures of Balcar and Simon. The proof uses pcf theory.

Let μ be singular of uncountable cofinality. If μ > 2cf(μ), we prove that in P = ([μ]μ, ⊇) as a forcing notion we have a natural complete embedding of Levy (‮א‬₀, μ⁺) (so P collapses μ⁺ to ‮א‬₀) and even Levy ($(\aleph _{0},U_{J_{\kappa}^{{\rm bd}}}(\mu))$). The "natural" means that the forcing ({p ∈ [μ]μ: p closed}, ⊇) is naturally embedded and is equivalent to the Levy algebra. Also if P fails the χ-c.c. then it collapses χ to ‮א‬₀ (and the (...) parallel results for the case μ > ‮א‬₀ is regular or of countable cofinality). Moreover we prove: for regular uncountable κ, there is a family P of bκ partitions Ā = 〈Aα: α < κ〉 of κ such that for any A ∈ [κ]κ for some 〈Aα: α < κ〉 ∈ P we have α < κ ⇒ |Aα ⋂ A| = κ. (shrink)

We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a ideal J extending the nonstationary ideal on a regular uncountable cardinal \, our goal being to witness the nonsaturation of J by the existence of towers ).

We further develop a previously introduced method of constructing forcing notions with the help of morasses. There are two new results: (1) If there is a simplified (ω 1 , 1)-morass, then there exists a ccc forcing of size ω 1 that adds an ω 2 -Suslin tree. (2) If there is a simplified (ω 1 , 2)-morass, then there exists a ccc forcing of size ω 1 that adds a 0-dimensional Hausdorff topology τ on ω 3 which has spread (...) s(τ) = ω 1 . While (2) is the main result of the paper, (1) is only an improvement of a previous result, which is based on a simple observation. Both forcings preserve GCH. To show that the method can be changed to produce models where CH fails, we give an alternative construction of Koszmider's model in which there is a chain 〈X α | α < ω 2 〉 such that X α ⊆ ω 1 , X β — X α is finite and X α — X β has size ω 1 for all β < α < ω 2. (shrink)

It is consistent with ¬CH that every universal theory of relational structures with the joint embedding property and amalgamation for P --diagrams has a universal model of cardinality ℵ 1. For classes with amalgamation for P --diagrams it is consistent that $2^{\aleph_0} > \aleph_2$ and there is a universal model of cardinality ℵ 2.

This paper explores how the Generalized Continuum Hypothesis (GCH) arose from Cantor's Continuum Hypothesis in the work of Peirce, Jourdain, Hausdorff, Tarski, and how GCH was used up to Gödel's relative consistency result.

James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) his knowledge of set theory to a variety of areas in collaboration with other mathematicians, and he encouraged a community of mathematicians with engaging survey talks, enthusiastic discussions of open problems, and friendly mathematical conversations. (shrink)

If a˜cardinal κ1, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ0 and its new cofinality, ρ, is less than κ0, then, under some additional assumptions, each cardinal λ>κ1 less than cc/[κ1]<κ1) is collapsed to κ0 as well. If in addition N=M[f], where f : ρ→κ1 is an unbounded mapping, then N is a˜λ=κ0-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.

We show that it is independent whether club $\kappa $ -Miller forcing preserves $\kappa ^{++}$. We show that under $\kappa ^{ \kappa $, club $\kappa $ -Miller forcing collapses $\kappa ^{<\kappa }$ to $\kappa $. Answering a question by Brendle, Brooke-Taylor, Friedman and Montoya, we show that the iteration of ultrafilter $\kappa $ -Miller forcing does not have the Laver property.

We investigate the effect of adding $\omega _2$ Cohen reals on graphs on $\omega _2$, in particular we show that $\omega _2 \to (\omega _2, \omega : \omega )^2$ holds after forcing with $\mathsf {Add}(\omega, \omega _2)$ in a model of $\mathsf {CH}$. We also prove that this result is in a certain sense optimal as $\mathsf {Add}(\omega, \omega _2)$ forces that $\omega _2 \not \to (\omega _2, \omega : \omega _1)^2$.

We explore the existence and the size of infinite models of categorical theories having cardinality less than the size of the associated Tarski-Lindenbaum algebra. Restricting to totally transcendental, categorical theories we show that “Every tiny model is countable” is independent of ZFC. IfT is trivial there is at most one tiny model, which must be the algebraic closure of the empty set. We give a new proof that there are no tiny models ifT is not totally transcendental and is non-trivial.

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman’s neat simplified morasses called 2-cardinals. The theory of related trees, gaps, colorings of pairs and forcing notions is reformulated and sketched from a unifying point of view with the focus on the applicability to constructions of mathematical structures like Boolean algebras, Banach spaces or compact spaces. The paper is (...) dedicated to the memory of Jim Baumgartner whose seminal joint paper :109–129, 1987) with Saharon Shelah provided a critical mass in the theory in question. A new result which we obtain as a side product is the consistency of the existence of a function \ with the appropriate \-version of property \ for regular \ satisfying \. (shrink)