324 citations · 1.7k across the 753 of their papers we have counts for
34 papers · 2 filters
The number of independent elements in the product of interval Boolean algebras
Saharon Shelah
We prove that in the product of kappa many Boolean algebras we cannot find an independent set of more than 2^kappa elements solving a problem of Monk (earlier it was known that we…
On tree ideals
Martin Goldstern, Miroslav Repicky, Saharon Shelah +1
Let l^0 and m^0 be the ideals associated with Laver and Miller forcing, respectively. We show that add (l^0) < cov(l^0) and add (m^0) < cov(m^0) are consistent. We also show that b…
Models with second order properties, V: A General principle
Bradd Hart, Claude Laflamme, Saharon Shelah
We present a general framework for carrying out some constructions. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player c…
A combinatorial forcing for coding the universe by a real when there are no sharps
Saharon Shelah, Lee Stanley
Assuming 0# does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the…
Examples for Souslin forcing
Haim Judah, Andrzej Rosłanowski, Saharon Shelah
We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin…
Addendum to ``Maximal Chains in $\fomom$ and Ultrapowers of the Integers''
Saharon Shelah, Juris Steprāns
Upon presenting the proof of Theorem 3.3 in "Maximal chains in $$ and ultrapowers of the integers" I discovered that it is not entirely correct and certainly some details should be…