Searcharxiv⌕ Search

arXiv subjects

Saharon Shelah

Publications and source records attributed to Saharon Shelah.

At least 739 records · Page 41Linked to original sources

In the random graph G(n,p),p=n^{-a} : if psi has probability 0(n^{-epsilon}) for every epsilon > 0 then it has probability 0(e^{-n^epsilon}) for some epsilon > 0

Shelah Spencer [ShSp:304] proved the 0-1 law for the random graphs G(n,p_n), p_n=n^{- alpha}, alpha in (0,1) irrational (set of nodes in [n]= {1, ...,n}, the edges are drawn independently, probability of edge is p_n). One may wonder what can we say on sentences psi for which Prob (G(n,p_n) models psi) converge to zero, Lynch asked the question and did the analysis, getting (for every psi): EITHER [(alpha)] Prob [G(n,p_n) models psi]=cn^{- beta} + O(n^{- beta-epsilon}) for some epsilon such that beta >epsilon>0 OR [(beta)] Prob (G(n,p_n) models psi)= O(n^{-epsilon}) for every epsilon>0. Lynch conjectured that in case (beta) we have [(beta^+)] Prob (G(n,p_n) models psi)= O(e^{-n^epsilon}) for some epsilon>0. We prove it here.

math.LO↗

A ZFC Dowker space in $\aleph_{ω+1}$: an application of pcf theory to topology

A ZFC Dowker space is constructed which has cardinality $\aleph_{ω+1}$. This provides a bound in ZFC to the first cardinal in which there is a ZFC Dowker space. The space we construct is a closed and cofinal subspace of M.~E.~Rudin's Dowker space from 1971. A theorem from pcf theory used in the proof, but otherwise the proof is elementary.

math.LO↗

On Gross spaces

A Gross space is a vector space E of infinite dimension over some field F, which is endowed with a symmetric bilinear form Phi:E^2 -> F and has the property that every infinite dimensional subspace U subseteq E satisfies dim U^perp < dim E. Gross spaces over uncountable fields exist (in certain dimensions). The existence of a Gross space over countable or finite fields (in a fixed dimension not above the continuum) is independent of the axioms of ZFC. Here we continue the investigation of Gross spaces. Among other things we show that if the cardinal invariant b equals omega_1 a Gross space in dimension omega_1 exists over every infinite field, and that it is consistent that Gross spaces exist over every infinite field but not over any finite field. We also generalize the notion of a Gross space and construct generalized Gross spaces in ZFC.

math.LO↗

On squares, outside guessing of clubs and I_{<f}[lambda]

Suppose that lambda = mu^+. We consider two aspects of the square property on subsets of lambda. First, we have results which show e.g. that for aleph_0 <= kappa =cf (kappa)< mu, the equality cf([mu]^{<= kappa}, subseteq)= mu is a sufficient condition for the set of elements of lambda whose cofinality is bounded by kappa, to be split into the union of mu sets with squares. Secondly, we introduce a certain weak version of the square property and prove that if mu is a strong limit, then this weak square property holds on lambda without any additional assumptions

math.LO↗

Universal in (< lambda)-stable abelian group

A characteristic result is that if 2^{aleph_0}< mu < mu^+< lambda = cf(lambda)< mu^{aleph_0}, then among the separable reduced p-groups of cardinality lambda which are (< lambda)-stable there is no universal one.

math.LO↗

A model in which every infinite Boolean algebra has many subalgebras

We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2^{|A|} = 2^{|B|}. This implies in particular that B has 2^{|B|} subalgebras. We also discuss some more general problems about subalgebras and free subsets of an algebra. The result on the number of subalgebras in a Boolean algebra solves a question of Monk. The paper is intended to be accessible as far as possible to a general audience, in particular we have confined the more technical material to a ``black box'' at the end. The proof involves a variation on Foreman and Woodin's model in which GCH fails everywhere.

math.LO↗

Cardinal invariants above the continuum

We prove some consistency results about b(lambda) and d(lambda), which are natural generalisations of the cardinal invariants of the continuum b and d. We also define invariants b_cl(lambda) and d_cl(lambda), and prove that almost always b(lambda) = b_cl(lambda) and d(lambda)=d_cl(lambda)

math.LO↗

Finite canonization

The canonization theorem says that for given m,n for some m^* (the first one is called ER(n;m)) we have: for every function f with domain [{1, ...,m^*}]^n, for some A in [{1, ...,m^*}]^m, the question of when the equality f({i_1, ...,i_n})=f({j_1, ...,j_n}) (where i_1< ... <i_n and j_1 < ... < j_n are from A) holds has the simplest answer: for some v subseteq {1, ...,n} the equality holds iff (for all l in v)(i_l = j_l). In this paper we improve the bound on ER(n,m) so that fixing n the number of exponentiation needed to calculate ER(n,m) is best possible.

math.CO↗

Embedding Cohen algebras using pcf theory

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list (attributed to Rene David and Sy Friedman).

math.LO↗

Toward classifying unstable theories

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories without the tree property, a class properly containing the stable theories) behaves ``better'' than theories with the strict order property, by criterion from [Sh:457]. In the second section we introduce properties SOP_n such that the strict order property implies SOP_{n+1}, which implies SOP_n, which in turn implies the tree property. Now SOP_4 already implies non-existence of universal models in cases where earlier the strict order property was needed, and SOP_3 implies maximality in the Keisler order, again improving an earlier result which had used the strict order property.

math.LO↗

Partial orderings with the weak Freese-Nation property

A partial ordering P is said to have the weak Freese-Nation property (WFN) if there is a mapping f:P ---> [P]^{<= aleph_0} such that, for any a, b in P, if a <= b then there exists c in f(a) cap f(b) such that a <= c <= b. In this note, we study the WFN and some of its generalizations. Some features of the class of BAs with the WFN seem to be quite sensitive to additional axioms of set theory: e.g., under CH, every ccc cBA has this property while, under b >= aleph_2, there exists no cBA with the WFN.

math.LO↗

On the very weak 0-1 law for random graphs with orders

Let us draw a graph R on {0,1,...,n-1} by having an edge {i,j} with probability p_(|i-j|), where sum_i p_i is finite and let M_n=(n,<,R). For a first order sentence psi let a^n_psi be the probability of ``M_n satisfies psi''. We prove that the limit of a^n_psi-a^{n+1}_psi is 0, as n goes to infinity.

math.LO↗

More on real-valued measurable cardinals and forcing with ideals

Answering two questions of D. Fremlin [Real-valued measurable cardinals, in Set Theory of the Reals, H. Judah ed. 1993, 151-305 ] we show the following: (1) If c is real-valued measurable then the Maharam type of (c,P(c),sigma) is 2^c. (2) It is consistent to have k real-valued measurable but for every submodel V_1 with k measurable in it there are no k reals which are random over V_1.

math.LO↗

Localizations of infinite subsets of omega

In the present paper we are interested in properties of forcing notions which measure in a sense the distance between the ground model reals and the reals in the extension. We look at the ways the ``new'' reals can be aproximated by ``old'' reals. We consider localizations for infinite subsets of omega. Though each member of [omega]^omega can be identified with its increasing enumeration, the (standard) localizations of the enumeration does not provide satisfactory information on successive points of the set. They give us ``candidates'' for the n-th point of the set but the same candidates can appear several times for distinct n. That led to a suggestion that we should consider disjoint subsets of omega as sets of ``candidates'' for successive points of the localized set. We have two possibilities. Either we can demand that each set from the localization contains a limited number of members of the localized set or we can postulate that each intersection of that kind is large. Localizations of this kind are studied in section 1. In the second section we investigate localizations of infinite subsets of omega by sets of integers from the ground model. These localizations might be thought as localizations by partitions of omega into successive intervals.

math.LO↗