4 citations · 6 across the 9 of their papers we have counts for
29 papers
On a problem of Erdos and Hajnal
Shimon Garti, Yair Hayut, Saharon Shelah
We address a question of ErdÅs and Hajnal about the ordinary partition relation . For , assuming…
Building complicated index models and Boolean algebras
Saharon Shelah
We build models using an indiscernible model sub-structures of and related more complicated structures. We use this to build various Boolean algebras.
Modules and Infinitary Logics
Saharon Shelah
We prove that the theory of abelian groups and R-modules even in infinitary logic is stable and understood to some extent.
A complicated family of trees with omega + 1 levels
Saharon Shelah
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |…
Length and ultraproducts
Shimon Garti, Saharon Shelah
We construct, in ZFC, a sequence of Boolean algebras for which the product of Lengths is strictly smaller than the Length of the product algebra.
-free abelian non-Archimedean Polish groups
Gianluca Paolini, Saharon Shelah
An uncountable -free group cannot admit a Polish group topology but an uncountable -free abelian group can, as witnessed, for example, by the Baer-Specker group…