activity
19922026
most citedThe monadic theory of order

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

collaborators
Showing 2014 · math.LOShow all

15 papers · 2 filters

math.LO2014

Hanf number for the strictly stable cases

Saharon Shelah

Suppose t = (T,T_1, p) is a triple of two theories T subset T_1 in vocabularies tau subset tau_1 (respectively) of cardinality lambda and a tau_1-type p over the empty set; in the…

math.LO2014

Superstable theories and representation

Saharon Shelah

In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the menti…

math.LO2014★ 1 cited

On embedding certain partial orders into the P-points under RK and Tukey reducibility

Dilip Raghavan, Saharon Shelah

The study of the global structure of ultrafilters on the natural numbers with respect to the quasi-orders of Rudin-Keisler and Rudin-Blass reducibility was initiated in the 1970s b…

math.LO2014

The generic pair conjecture for dependent finite diagrams

Itay Kaplan, Noa Lavi, Saharon Shelah

This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in th…

math.LO2014

Forcing a countable structure to belong to the ground model

Itay Kaplan, Saharon Shelah

Suppose that is a forcing notion, is a language (in ), a -name such that " is a countable -structure". In the product , there a…

math.LO2014★ 1 cited

The last forcing standing with diamonds

Andrzej Roslanowski, Saharon Shelah

This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies…