S. Shelah

activity

19922026

most citedThe monadic theory of order

324 citations · 1.7k across the 753 of their papers we have counts for

collaborators

Showing 2024 · math.LOShow all

5 papers · 2 filters

math.LO2024

Nowhere trivial automorphisms of $P (λ) / [λ]^{< λ}$ , for $λ$ inaccessible

Jakob Kellner, Saharon Shelah

If $λ$ is (strongly) inaccessible and $2^{λ} = λ^{+}$ , then there is a nowhere trivial automorphism of the Boolean algebra $P (λ) / [λ]^{< λ}$ .

math.LO2024

$ℵ_{1}$ -free abelian non-Archimedean Polish groups

Gianluca Paolini, Saharon Shelah

An uncountable $ℵ_{1}$ -free group cannot admit a Polish group topology but an uncountable $ℵ_{1}$ -free abelian group can, as witnessed, for example, by the Baer-Specker group…

math.LO2024

Infinite Cliques in Simple and Stable Graphs

Yatir Halevi, Itay Kaplan, Saharon Shelah

Suppose that $G$ is a graph of cardinality $μ^{+}$ with chromatic number $χ (G) \geq μ^{+}$ . One possible reason that this could happen is if $G$ contains a clique of size $μ^{+}$ . We prov…

math.LO2024

Diamond on Kurepa trees

Ziemowit Kostana, Assaf Rinot, Saharon Shelah

We introduce a new weak variation of diamond that is meant to only guess the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by pr…

math.LO2024★ 2 cited

Building complicated index models and Boolean algebras

Saharon Shelah

We build models using an indiscernible model sub-structures of $κ \geq λ$ and related more complicated structures. We use this to build various Boolean algebras.

Nowhere trivial automorphisms of P(λ)/[λ]<λ, for λ inaccessible

ℵ1​-free abelian non-Archimedean Polish groups

Infinite Cliques in Simple and Stable Graphs

Diamond on Kurepa trees

Building complicated index models and Boolean algebras

Nowhere trivial automorphisms of $P (λ) / [λ]^{< λ}$ , for $λ$ inaccessible

$ℵ_{1}$ -free abelian non-Archimedean Polish groups