We continue investigations of reasonable ultrafilters on uncountable cardinals defined in previous work by Shelah. We introduce stronger properties of ultrafilters and we show that those properties may be handled in λ-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating systems of size less than $2^\lambda$ . We also show how ultrafilters generated by small systems can be killed by forcing notions which have enough (...) reasonable completeness to be iterated with λ-supports. (shrink)

This article continues Rosłanowski and Shelah (Int J Math Math Sci 28:63–82, 2001; Quaderni di Matematica 17:195–239, 2006; Israel J Math 159:109–174, 2007; 2011; Notre Dame J Formal Logic 52:113–147, 2011) and we introduce here a new property of (<λ)-strategically complete forcing notions which implies that their λ-support iterations do not collapse λ + (for a strongly inaccessible cardinal λ).

This paper is concerned with n-localization property introduced by Newelski and Rosłanowski in [10] and getting it for CS iterations of forcing notions.

We prove that the Sacks forcing collapses the continuum onto ${\frak d}$ , answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses $\omega_2$ then it forces $\diamondsuit_{\omega_{1}}$.

We continue developing the general theory of forcing notions built with the use of norms on possibilities, this time concentrating on ccc forcing notions and classifying them.

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah [8]. We introduce a general scheme of generating a filter on λ from filters on smaller sets and we investigate the combinatorics of objects obtained this way.

Let I be an ideal of subsets of a Polish space X, containing all singletons and possessing a Borel basis. Assuming that I does not satisfy ccc, we consider the following conditions (B), (M) and (D). Condition (B) states that there is a disjoint family F $\subseteq$ P(X) of size c, consisting of Borel sets which are not in I. Condition (M) states that there is a Borel function f: X → X with $f^{-1}[\{x\}] \not\in$ I for each x ∈ (...) X. Provided that X is a group and I is invariant, condition (D) states that there exist a Borel set B $\not\in$ I and a perfect set P $\subseteq$ X for which the family $\{B + x: x \in P\}$ is disjoint. The aim of the paper is to study whether the reverse implications in the chain (D) $\Rightarrow$ (M) $\Rightarrow$ (B) $\Rightarrow$ not-ccc can hold. We build a σ-ideal on the Cantor group witnessing (M) & ¬ (D) (Section 2). A modified version of that σ-ideal contains the whole space (Section 3). Some consistency results on deriving (M) from (B) for "nicely" defined ideals are established (Sections 4 and 5). We show that both ccc and (M) can fail (Theorems 1.3 and 5.6). Finally, some sharp versions of (M) for invariant ideals on Polish groups are investigated (Section 6). (shrink)

We study the cardinal invariants of measure and category after adding one random real. In particular, we show that the number of measure zero subsets of the plane which are necessary to cover graphs of all continuous functions may be large while the covering for measure is small.

We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such.

We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that . We prove consistency of the statement “there is a Boolean algebra such that ” and we force a superatomic Boolean algebra such that , and . Next we force a superatomic algebra such that and a superatomic algebra such that . Finally we show that consistently there is a Boolean algebra of (...) size λ such that there is no free sequence in of length λ, there is an ultrafilter of tightness λ and. (shrink)

Our main result states that a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the σ-ideals determined by those universality parameters.