324 citations · 1.7k across the 753 of their papers we have counts for
13 papers · 2 filters
PCF: The advanced PCF theorems
Saharon Shelah
This is a revised version of Sh:430, section 6.
Combinatorial background for non-structure
Saharon Shelah
This was supposed to be an appendix to the book "Non-structure", and probably will be if it materializes. It presents relevant material, sometimes new, which was used in works whic…
Random Graph: Stronger logic but with the zero one law
Saharon Shelah
We find a logic really stronger than first order for the random graph with edge probability but satisfies the 0-1 law. This means that on the one hand it satisfies the 0…
An extension of the Ehrenfeucht-Fraisse game for first order logics augmented with Lindstrom quantifiers
Simi Haber, Saharon Shelah
We propose an extension of the Ehrenfeucht-Fraisse game able to deal with logics augmented with Lindstrom quantifiers. We describe three different games with varying balance betwee…
Random graphs and Lindstrom quantifiers for natural graph properties
Simi Haber, Saharon Shelah
We study zero-one laws for random graphs. We focus on the following question that was asked by many: Given a graph property P, is there a language of graphs able to express P while…
Exact saturation in simple and NIP theories
Itay Kaplan, Saharon Shelah, Pierre Simon
A theory is said to have exact saturation at a singular cardinal if it has a -saturated model which is not -saturated. We show, under some set-theoretic assumptio…