Some subfamilies of κ, for κ regular, κ λ, called -semimorasses are investigated. For λ = κ+, they constitute weak versions of Velleman's simplified -morasses, and for λ > κ+, they provide a combinatorial framework which in some cases has similar applications to the application of -morasses with this difference that the obtained objects are of size λ κ+, and not only of size κ+ as in the case of morasses. New consistency results involve existence of nonreflecting objects of singular (...) sizes of uncountable cofinality such as a nonreflecting stationary set in κ, a nonreflecting nonmetrizable space of size λ, a nonreflecting nonspecial tree of size λ. We also characterize possible minimal sizes of nonspecial trees without uncountable branches. (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)

We consider the existence of coherent families of finite-to-one functions on countable subsets of an uncountable cardinal κ. The existence of such families for κ implies the existence of a winning 2-tactic for player TWO in the countable-finite game on κ. We prove that coherent families exist on κ = ωn, where n ∈ ω, and that they consistently exist for every cardinal κ. We also prove that iterations of Axiom A forcings with countable supports are Axiom A.

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)

We introduce a class of forcing notions, called forcing notions of type S, which contains among other Sacks forcing, Prikry-Silver forcing and their iterations and products with countable supports. We construct and investigate some formalism suitable for this forcing notions, which allows all standard tricks for iterations or products with countable supports of Sacks forcing. On the other hand it does not involve internal combinatorial structure of conditions of iterations or products. We prove that the class of forcing notions of (...) type S is closed under products and certain iterations with countable supports. (shrink)