arXiv subjects
Publications and source records attributed to Saharon Shelah.
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on lambda are distinct.
Let S=Sym(Ω) be the group of all permutations of a countably infinite set Ω, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if there exists a finite set U\subseteq S such that < G_1\cup U > = < G_2\cup U >. It is shown that the subgroups closed in the function topology on S lie in precisely four equivalence classes under this relation. Which of these classes a closed subgroup G belongs to depends on which of the following statements about pointwise stabilizer subgroups G_{(Γ)} of finite subsets Γ\subseteqΩholds: (i) For every finite set Γ, the subgroup G_{(Γ)} has at least one infinite orbit in Ω. (ii) There exist finite sets Γsuch that all orbits of G_{(Γ)} are finite, but none such that the cardinalities of these orbits have a common finite bound. (iii) There exist finite sets Γsuch that the cardinalities of the orbits of G_{(Γ)} have a common finite bound, but none such that G_{(Γ)}=\{1\}. (iv) There exist finite sets Γsuch that G_{(Γ)}=\{1\}. Some questions for further investigation are discussed.
This continues recent work in a paper by Corner, Gobel and Goldsmith. A particular question was left open: Is it possible to carry over the results concerning the undecidability of torsion--free Crawley groups to modules over the ring of p-adic integers? We will confirm this and also strengthen one of the older results in by replacing the hypothesis of diamondsuit by CH.
We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be embedded in Pi(lambda,< beta). The proof involves some set-theoretic results, one about familes of finite sets and one about families of ultrafilters.
The authors show, by means of a finitary version square^{fin}_{lambda,D} of the combinatorial principle square^{b^*}_{lambda}, the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all regular filters D on a cardinal lambda, if M_i and N_i are elementarily equivalent models of a language of size <= lambda, then the second player has a winning strategy in the Ehrenfeucht-Fraisse game of length lambda^+ on prod_i M_i/D and prod_i N_i/D. If in addition 2^{lambda}= lambda^+ and i<lambda implies |M_i|+|N_i| <= lambda^+ this means that the ultrapowers are isomorphic.
In this note we answer the following question of Grinblat: Is it consistent that for some set X, cov(NULL restriction X)=lambda is a weakly inaccessible cardinal (so X not null of course) while cov(meagre) is small, say it is aleph_1.
We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such.
We give three examples of large intervals in the lattice of (local) clones on an infinite set X, by exhibiting clones C_1, C_2, C_3 such that: (1) the interval [C_1, O] in the lattice of local clones is (as a lattice) isomorphic to {0,1,2, ...} under the divisibility relation, (2) the interval [C_2, O] in the lattice of local clones is isomorphic to the congruence lattice of an arbitrary semilattice, (3) the interval [C_3, O] in the lattice of all clones is isomorphic to the lattice of all filters on X. These examples explain the difficulty of obtaining a satisfactory analysis of the clone lattice on infinite sets. In particular, (1) shows that the lattice of local clones is not dually atomic.
The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the sigma-ideals determined by those universality parameters.
Let kappa a regular uncountable cardinal and lambda a cardinal >kappa, and suppose lambda^{ ^kappa (I_{kappa, lambda}^+,omega +1)^2, (b) I_{kappa, lambda}^+ -->^kappa [I_{kappa, lambda}^+]_{kappa^+}^2 if kappa is a limit cardinal, and (c) I_{kappa, lambda}^+ -->^kappa (I_{kappa, lambda}^+)^2 if kappa is weakly compact.
We study how equivalent nonisomorphic models an unsuperstable theory can have. We measure the equivalence by Ehrenfeucht-Fraisse games.
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{ with |B_i|<mu_i, and finally we deal with the existence of strongly almost disjoint families.
We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality aleph_1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove that it is consistent that every Whitehead group is free but not every hereditarily separable group is free. We also show that the fact that Z is a p.i.d. with infinitely many primes is essential for this result.
We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum separable metric spaces on aleph_1 so that every separable metric space is almost isometrically embedded into one of them when the continuum hypothesis fails. (3) There is no collection of fewer than continuum metric spaces of cardinality aleph_2 so that every ultra-metric space of cardinality aleph_2 is almost isometrically embedded into one of them if aleph_2<2^{aleph_0}. We also prove that various spaces X satisfy that if a space X is almost isometric to X than Y is isometric to X.
We show in ZFC, that the depth of ultraproducts of Boolean Algebras may be bigger than the ultraproduct of the depth of those Boolean Algebras.
This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem: Theorem: Let C be a large homogeneous model of a stable diagram D. Let p, q in S_D(A), where p is quasiminimal and q unbounded. Let P=p(C) and Q=q(C). Suppose that there exists an integer n<omega such that dim(a_1...a_n/A cup C)=n, for any independent a_1,..., a_n in P and finite subset C subseteq Q, but dim(a_1...a_n a_{n+1}/A cup C) <= n, for some independent a_1,...,a_n,a_{n+1} in P and some finite subset C subseteq Q. Then C interprets a group G which acts on the geometry P' obtained from P. Furthermore, either C interprets a non-classical group, or n=1,2,3 and * If n=1 then G is abelian and acts regularly on P'. * If n=2 the action of G on P' is isomorphic to the affine action of K times K^* on the algebraically closed field K. * If n = 3 the action of G on P' is isomorphic to the action of PGL_2(K) on the projective line {P}^1(K) of the algebraically closed field K .
We strengthen the revised GCH theorem by showing, e.g., that for lambda=cf(lambda)>beth_omega, for all but finitely many regular kappa beth_omega implies the diamond on lambda is restricted to cofinality kappa for all but finitely many kappa in Reg cap beth_omega and we strengthen the results on the middle diamond. Moreover, we get stronger results on the middle diamond.
For every regular cardinal kappa there exists a simple complete Boolean algebra with kappa generators.