Searcharxiv⌕ Search

arXiv subjects

Saharon Shelah

Publications and source records attributed to Saharon Shelah.

At least 289 records · Page 16Linked to original sources

A.E.C. with not too many models

Consider an a.e.c. (abstract elementary class), that is, a class K of models with a partial order refining inclusion (submodel) which satisfy the most basic properties of an elementary class. Our test question is trying to show that the function dot I (lambda, K), counting the number of models in K of cardinality lambda up to isomorphism, is "nice", not chaotic, even without assuming it is sometimes 1, i.e. categorical in some lambda's. We prove here that for some closed unbounded class C of cardinals we have (a), (b) or (c) where (a) for every lambda in C of cofinality aleph_0, dot I (lambda, K) greater than or equal to lambda, (b) for every lambda in C of cofinality aleph_0 and M belongs to K_lambda, for every cardinal kappa greater than or equal to lambda there is N_kappa of cardinality kappa extending M (in the sense of our a.e.c.), (c) mathfrak k is bounded; that is, dot I (lambda, K) = 0 for every lambda large enough (equivalently lambda greater than or equal to beth_{delta_*} where delta_* = (2^{LST(mathfrak k)})^+). Recall that an important difference of non-elementary classes from the elementary case is the possibility of having models in K, even of large cardinality, which are maximal, or just failing clause (b).

math.LO↗

Dependent theories and the generic pair conjecture

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory is the combination of the one for stable theories and the one for the theory of dense linear order or trees (and first we should try to understand the quite saturated case). As a measure of our progress, we give several applications considering some test questions; in particular we try to prove the generic pair conjecture and do it for measurable cardinals.

math.LO↗

Models of Cohen measurability

We show that in contrast with the Cohen version of Solovay's model, it is consistent for the continuum to be Cohen-measurable and for every function to be continuous on a non-meagre set.

math.LO↗

Many countable support iterations of proper forcings preserve Souslin trees

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support interations in the so-called Case A that does not need a division into forcings that add reals and those who do not.

math.LO↗

Examples in dependent theories

In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an example where the pair is not dependent. Then we define the notion of directionality which deals with counting the number of coheirs of a type and we give examples of the different possibilities. Then we discuss non-splintering, an interesting notion that appears in the work of Rami Grossberg, Andrés Villaveces and Monica VanDieren, and we show that it is not trivial (in the sense that it can be different than splitting) whenever the directionality of the theory is not small. In the appendix we study dense types in RCF.

math.LO↗

A dependent theory with few indiscernibles

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $θ$ there is a dependent theory $T$ of size $θ$ such that for all $κ$ and $δ$, $κ\to\left(δ\right)_{T,1}$ iff $κ\to\left(δ\right)_θ^{<ω}$. This means that unless there are good set theoretical reasons, there are large sets with no indiscernible sequences.

math.LO↗

Symmetrically complete ordered sets, abelian groups and fields

We characterize and construct linearly ordered sets, abelian groups and fields that are {\emph symmetrically complete}, meaning that the intersection over any chain of closed bounded intervals is nonempty. Such ordered abelian groups and fields are important because generalizations of Banach's Fixed Point Theorem hold in them. We prove that symmetrically complete ordered abelian groups and fields are divisible Hahn products and real closed power series fields, respectively. We show how to extend any given ordered set, abelian group or field to one that is symmetrically complete. A main part of the paper establishes a detailed study of the cofinalities in cuts.

math.LO↗

Positional strategies in long Ehrenfeucht-Fraissé games

We prove that it is relatively consistent with ZF + CH that there exist two models of cardinality \aleph_2 such that the second player has a winning strategy in the Ehrenfeucht-Fraïssé-game of length ω_1 but there is no σ-closed back-and-forth set for the two models. If CH fails, no such pairs of models exist.

math.LO↗

Regular Ultrapowers at Regular Cardinals

In earlier work of the second and third author the equivalence of a finite square principle square^fin_{lambda,D} with various model theoretic properties of structures of size lambda and regular ultrafilters was established. In this paper we investigate the principle square^fin_{lambda,D}, and thereby the above model theoretic properties, at a regular cardinal. By Chang's Two-Cardinal Theorem, square^fin_{lambda,D} holds at regular cardinals for all regular filters D if we assume GCH. In this paper we prove in ZFC that for certain regular filters that we call "doubly^+ regular", square^fin_{lambda,D} holds at regular cardinals, with no assumption about GCH. Thus we get new positive answers in ZFC to Open Problems 18 and 19 in the book "Model Theory" by Chang and Keisler.

math.LO↗

Applications of pcf for mild large cardinals to elementary embeddings

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing sequence (lambda_i | i < kappa) of regular cardinals converging to mu such that lambda = tcf(prod_{i < kappa} lambda_i, <_{J^{bd}_kappa}). 2. Let mu be a strong limit cardinal and theta a cardinal above mu. Suppose that at least one of them has an uncountable cofinality. Then there is sigma_* < mu such that for every chi < theta the following holds: theta > sup{sup pcf_{sigma_*-complete} (frak a) | frak a subseteq Reg cap (mu^+, chi) and |frak a| < mu}. As an application we show that: if kappa is a measurable cardinal and j:V to M is the elementary embedding by a kappa-complete ultrafilter over kappa, then for every tau the following holds: 1. if j(tau) is a cardinal then j(tau) = tau; 2. |j(tau)| = |j(j(tau))|; 3. for any kappa-complete ultrafilter W on kappa, |j (tau)| = |j_W(tau)|. The first two items provide affirmative answers to questions from Gitik and Shelah (1993) [2] and the thrid to a question of D. Fremlin.

math.LO↗

Strong colorings yield kappa-bounded spaces with discretely untouchable points

It is well-known that every non-isolated point in a compact Hausdorff space is the accumulation point of a discrete subset. Answering a question raised by Z. Szentmiklossy and the first author, we show that this statement fails for countably compact regular spaces, and even for omega-bounded regular spaces. In fact, there are kappa-bounded counterexamples for every infinite cardinal kappa. The proof makes essential use of the so-called 'strong colorings' that were invented by the second author.

math.GN↗

Many forcing axioms for all regular uncountable cardinals

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should work for R-modules, etc. As in earlier cases part of the work is analyzing how to move between the set theory and the algebra. Set theoretically we try to force a universe which satisfies G.C.H. and diamond holds for many stationary sets but, for every regular uncountable lambda, in some sense anything which "may" hold for some stationary set, does hold for some stationary set. More specifically we try to get a universe satisfying GCH such that e.g. for regular kappa < lambda there are pairs (S,B), S \subseteq S^λ_κstationary, B \subseteq H (lambda), which satisfies some pregiven forcing axiom related to (S,B), (so (lambda\ S)-complete, i.e. "trivial outside S) but no more, i.e. slightly stronger versions fail. So set theoretically we try to get a universe satisfying G.C.H. but still satisfies "many", even for a maximal family in some sense, of forcing axioms of the form "for some stationary" while preserving GCH. As completion of the work lagged for a while, here we deal only with the set theory.

math.LO↗

Around cofin

We show the consistency of "there is a nice sigma --ideal I on the reals with add(I)= omega_1 which cannot be represented as the union of a strictly increasing sequence of length omega_1 of sigma-subideals". This answers a question by Borodulin-Nadzieja and Glab.

math.LO↗

Ranks for strongly dependent theories

There is much more known about the family of superstable theories when compared to stable theories. This calls for a search of an analogous "super-dependent" characterization in the context of dependent theories. This problem has been treated in \cite{Sh:783,Sh:863}, where the candidates "Strongly dependent", "Strongly dependent^2" and others were considered. These families generated new families when we are considering intersections with the stable family. Here, continuing \cite[§2, §5E,F,G]{Sh:863}, we deal with several candidates, defined using dividing properties and related ranks of types. Those candidates are subfamilies of "Strongly dependent". Fulfilling some promises from \cite{Sh:863} in particular \cite[1.4(4)]{Sh:863}, we try to make this self contained within reason by repeating some things from there. More specifically we fulfil some promises from \cite{Sh:863} to to give more details, in particular: in \S4 for \cite[1.4(4)]{Sh:863}, in \S2 for \cite[5.47(2)=Ldw5.35(2)]{Sh:863} and in \S1 for \cite[5.49(2)]{Sh:863}

math.LO↗

More on Compactness of Chromatic Numbers

We prove that for any regular kappa and mu > kappa below the first fix point (lambda = aleph_lambda) above kappa, there is a graph with chromatic number > kappa, and mu^kappa nodes but every subgraph of cardinality < mu has chromatic number less than or equal to kappa.

math.LO↗

Dependent first order theories, continued

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being dependent. Another one justifies the cofinality restriction in the theorem (from a previous work) saying that pairwise perpendicular indiscernible sequences, can have arbitrary dual-cofinalities in some models containing them.

math.LO↗

Ordered Black Boxes: Existence

We defined ordered black boxes in which for a partial $J$ we try to predict just a bound in $J$ to a function restricted to $C_α$. The existence results are closely related to pcf, propagating downward. We can start with trivial cases.

math.LO↗