Searcharxiv⌕ Search

arXiv subjects

Saharon Shelah

Publications and source records attributed to Saharon Shelah.

At least 847 records · Page 47Linked to original sources
arXiv1992

Pointwise compact and stable sets of measurable functions

In a series of papers, M.Talagrand, the second author and others investigated at length the properties and structure of pointwise compact sets of measurable functions. A number of problems, interesting in themselves and important for the theory of Pettis integration, were solved subject to various special axioms. It was left unclear just how far the special axioms were necessary. In particular, several results depended on the fact that it is consistent to suppose that every countable relatively pointwise compact set of Lebesgue measurable functions is `stable' in Talagrand's sense; the point being that stable sets are known to have a variety of properties not shared by all pointwise compact sets. In the present paper we present a model of set theory in which there is a countable relatively pointwise compact set of Lebesgue measurable functions which is not stable, and discuss the significance of this model in relation to the original questions. A feature of our model which may be of independent interest is the following: in it, there is a closed negligible set Q subseteq [0,1]^2 such that whenever D subseteq [0,1] has outer measure 1 then the set Q^{-1}[D]= {x:(exists y in D)((x,y) in Q)} has inner measure 1.

math.LO↗
arXiv1992

Non-existence of Universal Orders in Many Cardinals

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove --- again in ZFC --- that for a large class of cardinals there is no universal linear order (e.g. in every $\aleph_1<ł<2^{\aleph_0}$). In fact, what we show is that if there is a universal linear order at a regular $ł$ and its existence is not a result of a trivial cardinal arithmetical reason, then $ł$ ``resembles'' $\aleph_1$ --- a cardinal for which the consistency of having a universal order is known. As for singular cardinals, we show that for many singular cardinals, if they are not strong limits then they have no universal linear order. As a result of the non existence of a universal linear order, we show the non-existence of universal models for all theories possessing the strict order property (for example, ordered fields and groups, Boolean algebras, p-adic rings and fields, partial orders, models of PA and so on).

math.LO↗
arXiv1992

Many simple cardinal invariants

For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions (f,g). In the language of Blass: There may be aleph_1 many distinct uniform Pi^0_1 characteristics.

math.LO↗
arXiv1992

Full reflection of stationary sets at regular cardinals

A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha is a stationary subset of alpha. We prove that the Axiom of Full Reflection which states that every stationary set reflects fully at regular cardinals, together with the existence of n-Mahlo cardinals is equiconsistent with the existence of Pi^1_n-indescribable cardinals. We also state the appropriate generalization for greatly Mahlo cardinals.

math.LO↗
arXiv1992

Uniformization and the diversity of Whitehead groups

The connections between Whitehead groups and uniformization properties were investigated by the third author in [Sh:98]. In particular it was essentially shown there that there is a non-free Whitehead (respectively, aleph_1-coseparable) group of cardinality aleph_1 if and only if there is a ladder system on a stationary subset of omega_1 which satisfies 2-uniformization (respectively, omega-uniformization). These techniques allowed also the proof of various independence and consistency results about Whitehead groups, for example that it is consistent that there is a non-free Whitehead group of cardinality aleph_1 but no non-free aleph_1-coseparable group. However, some natural questions remained open, among them the following two: (i) Is it consistent that the class of W-groups of cardinality aleph_1 is exactly the class of strongly aleph_1-free groups of cardinality aleph_1 ? (ii) If every strongly aleph_1-free group of cardinality aleph_1 is a W-group, are they also all aleph_1-coseparable? In this paper we use the techniques of uniformization to answer the first question in the negative and give a partial affirmative answer to the second question.

math.LO↗
arXiv1992

Existence of endo-rigid Boolean algebras

In [Sh:89] we, answering a question of Monk, have explicated the notion of ``a Boolean algebra with no endomorphisms except the ones induced by ultrafilters on it'' (see section 2 here) and proved the existence of one with character density aleph_0, assuming first diamondsuit_{aleph_1} and then only CH. The idea was that if h is an endomorphism of B, not among the ``trivial'' ones, then there are pairwise disjoint D_n in B with h(d_n) not subset d_n. Then we can, for some S subset omega, add an element x such that d <= x for n in S, x cap d_n=0 for n not in S while forbidding a solution for {y cap h(d_n):n in S} cup {y cap h(d_n)=0:n not in S}. Further analysis showed that the point is that we are omitting positive quantifier free types. Continuing this Monk succeeded to prove in ZFC, the existence of such Boolean algebras of cardinality 2^{aleph_0}. We prove (in ZFC) the existence of such B of density character lambda and cardinality lambda^{aleph_0} whenever lambda > aleph_0. We can conclude answers to some questions from Monk's list. We use a combinatorial method from [Sh:45],[Sh:172], that is represented in Section 1.

math.LO↗
arXiv1992

Coding and reshaping when there are no sharps

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to prove that any subset of kappa^{+ omega} can be coded into a subset, W of kappa^+ which, further, ``reshapes'' the interval [kappa, kappa^+), i.e., for all kappa < delta < kappa^+, kappa = (card delta)^{L[W cap delta]}. We sketch two applications of this result, assuming 0^sharp does not exist. First, we point out that this shows that any set can be coded by a real, via a set forcing. The second application involves a notion of abstract condensation, due to Woodin. Our methods can be used to show that for any cardinal mu, condensation for mu holds in a generic extension by a set forcing.

math.LO↗
arXiv1992

Factor = quotient, uncountable Boolean algebras, number of endomorphism and width

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number of subalgebras is not smaller than the number of endomorphisms, and other related inequalities. Lastly we deal with the obtainment of the supremum of the cardinalities of sets of pairwise incomparable elements of a Boolean algebra.

math.LO↗
arXiv1992

Cardinal arithmetic for skeptics

We present a survey of some results of the pcf-theory and their applications to cardinal arithmetic. We review basics notions (in section 1), briefly look at history in section 2 (and some personal history in section 3). We present main results on pcf in section 5 and describe applications to cardinal arithmetic in section 6. The limitations on independence proofs are discussed in section 7, and in section 8 we discuss the status of two axioms that arise in the new setting. Applications to other areas are found in section 9.

math.LO↗
arXiv1992

The universality spectrum of stable unsuperstable theories

It is shown that if T is stable unsuperstable, and aleph_1< lambda =cf(lambda)< 2^{aleph_0}, or 2^{aleph_0} < mu^+< lambda =cf(lambda)< mu^{aleph_0} then T has no universal model in cardinality lambda, and if e.g. aleph_omega < 2^{aleph_0} then T has no universal model in aleph_omega. These results are generalized to kappa =cf(kappa) < kappa (T) in the place of aleph_0. Also: if there is a universal model in lambda >|T|, T stable and kappa < kappa (T) then there is a universal tree of height kappa +1 in cardinality lambda .

math.LO↗
arXiv1992

Linear liftings for non complete probability space

We show that it is consistent with ZFC that L^infty (Y,B, nu) has no linear lifting for many non-complete probability spaces (Y,B, nu), in particular for Y=[0,1]^A, B= Borel subsets of Y, nu = usual Radon measure on B .

math.LO↗
arXiv1991

The Hanf numbers of stationary logic. II. Comparison with other logics

We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in ZFC than previously known (those independence proofs assume CON(ZFC) only). We also get results on corresponding logics for L_{lambda, mu} .

math.LO↗
arXiv1991

The primal framework. II. Smoothness

This is the second in a series of articles developing abstract classification theory for classes that have a notion of prime models over independent pairs and over chains. It deals with the problem of smoothness and establishing the existence and uniqueness of a `monster model'. We work here with a predicate for a canonically prime model.

math.LO↗
arXiv1991

A partition theorem for pairs of finite sets

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite character.

math.LO↗