mu-complete Suslin trees on mu^+
We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .
math.LO↗
arXiv subjects
Saharon Shelah
Publications and source records attributed to Saharon Shelah.
The Ehrenfeucht-Fraisse-game of length omega_1
Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game of L_{omega omega} except that there are omega_1 moves. It is clear that G_{omega_1}(A,B) is determined if A and B are of cardinality <= aleph_1. We prove the following results: Theorem A: If V=L, then there are models A and B of cardinality aleph_2 such that the game G_{omega_1}(A,B) is non-determined. Theorem B: If it is consistent that there is a measurable cardinal, then it is consistent that G_{omega_1}(A,B) is determined for all A and B of cardinality <= aleph_2. Theorem C: For any kappa >= aleph_3 there are A and B of cardinality kappa such that the game G_{omega_1}(A,B) is non-determined.
math.LO↗
Every coseparable group may be free
We show that if 2^{aleph_0} Cohen reals are added to the universe, then for every reduced non-free torsion-free abelian group A of cardinality less than the continuum, there is a prime p so that Ext_p(A, Z) not= 0. In particular if it is consistent that there is a supercompact cardinal, then it is consistent (even with weak CH) that every coseparable group is free. The use of some large cardinal hypothesis is needed.
math.LO↗
Topological partition relations to the form omega^*-> (Y)^1_2
Theorem: The topological partition relation omega^{*}-> (Y)^{1}_{2} (a) fails for every space Y with |Y| >= 2^c ; (b) holds for Y discrete if and only if |Y| <= c; (c) holds for certain non-discrete P-spaces Y ; (d) fails for Y= omega cup {p} with p in omega^{*} ; (e) fails for Y infinite and countably compact.
math.LO↗
Viva la difference II. The Ax-Kochen isomorphism theorem
We show in section 1 that the Ax-Kochen isomorphism theorem requires the continuum hypothesis. Most of the applications of this theorem are insensitive to set theoretic considerations. (A probable exception is the work of Moloney.) In section 2 we give an unrelated result on cuts in models of Peano arithmetic which answers a question on the ideal structure of countable ultraproducts of Z. In section 1 we also answer a question of Keisler and Schmerl regarding Scott complete ultrapowers of R .
math.LO↗
The automorphism group of a saturated model has a large dense free subgroup
We prove that for a stable theory $T,$ if $M$ is a saturated model of $T$ of cardinality $λ$ where $λ> \big|T\big|,$ then $Aut(M)$ has a dense free subgroup on $2^λ$ generators. This affirms a conjecture of Hodges.
math.LO↗
On closed P-sets with ccc in the space omega^*
It is proved that -- consistently -- there can be no ccc closed P-sets in the remainder space omega^* .
math.LO↗
How special are Cohen and random forcings i.e. Boolean algebras of the family of subsets of reals modulo meagre or null
The feeling that those two forcing notions-Cohen and Random-(equivalently the corresponding Boolean algebras Borel(R)/(meager sets), Borel(R)/(null sets)) are special, was probably old and widespread. A reasonable interpretation is to show them unique, or ``minimal'' or at least characteristic in a family of ``nice forcing'' like Borel. We shall interpret ``nice'' as Souslin as suggested by Judah Shelah [JdSh 292]. We divide the family of Souslin forcing to two, and expect that: among the first part, i.e. those adding some non-dominated real, Cohen is minimal (=is below every one), while among the rest random is quite characteristic even unique. Concerning the second class we have weak results, concerning the first class, our results look satisfactory. We have two main results: one (1.14) says that Cohen forcing is ``minimal'' in the first class, the other (1.10) says that all c.c.c. Souslin forcing have a property shared by Cohen forcing and Random real forcing, so it gives a weak answer to the problem on how special is random forcing, but says much on all c.c.c. Souslin forcing.
math.LO↗
A variety with solvable, but not uniformly solvable, word problem
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with finitely many axioms having a decidable, but not uniformly decidable, word problem. Other related examples are given as well.
math.LO↗
Some compact logics --- results in ZFC
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various results. Next, we attempt to get compactness results for some other logics without recourse to diamond, i.e., all our results are in ZFC. We get the full result for the language where we quantify over automorphisms (isomorphisms) of ordered fields in Theorem 6.4. Unfortunately we are not able to show that the language with quantification over automorphisms of Boolean algebras is compact, but will have to settle for a close relative of that logic. This is theorem 5.1. In section 4 we prove we can construct models in which all relevant automorphism are somewhat definable: 4.1, 4.8 for BA, 4.13 for ordered fields. We also give a new proof of the compactness of another logic -- the one which is obtained when a quantifier Q_{Brch} is added to first order logic which says that a level tree (definitions will be given later) has an infinite branch. This logic was previously shown to be compact, but our proof yields a somewhat stronger result and provides a nice illustration of one of our methods.
math.LO↗
On the number of automorphism of uncontable models
Let s(A) denote the number of automorphisms of a model A of power omega_1. We derive a necessary and sufficient condition in terms of trees for the existence of an A with omega_1 < s(A) < 2^{omega_1}. We study the sufficiency of some conditions for s(A)=2^{omega_1}. These conditions are analogous to conditions studied by D.Kueker in connection with countable models.
math.LO↗
All meager filters may be null
We show that it is consistent with ZFC that all filters which have the Baire property are Lebesgue measurable. We also show that the existence of a Sierpinski set implies that there exists a nonmeasurable filter which has the Baire property.
math.LO↗
Explicitly nonstandard uniserial modules
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence of non-standard uniserial modules; this is a theorem of ZFC which complements an earlier independence result.
math.LO↗
Forcing isomorphism
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is classifiable if it is superstable and does not have either the dimensional order property or the omitting types order property. Shelah [Sh:c] showed that if a theory T is classifiable then each model of cardinality lambda is described by a sentence of L_{infty, lambda}. In fact this sentence can be chosen in the L^*_{lambda}. (L^*_{lambda} is the result of enriching the language L_{infty, beth^+} by adding for each mu < lambda a quantifier saying the dimension of a dependence structure is greater than mu .) The truth of such sentences will be preserved by any forcing that does not collapse cardinals <= lambda and that adds no new countable subsets of lambda. Hence, if two models of a classifiable theory of power lambda are non-isomorphic, they are non-isomorphic after a lambda-complete forcing. Here we show that the hypothesis of the forcing adding no new countable subsets of lambda cannot be eliminated. In particular, we show that non-isomorphism of models of a classifiable theory need not be preserved by ccc forcings.
math.LO↗
Borel partitions of infinite subtrees of a perfect tree
A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is false. Let us identify the reals with 2^omega ordered by the lexicographical ordering and define for distinct x,y in 2^omega, D(x,y) to be the least n such that x(n) not= y(n). Let the type of an increasing n-tuple {x_0, ... x_{n-1}}_< be the ordering <^* on {0, ...,n-2} defined by i<^*j iff D(x_i,x_{i+1})< D(x_j,x_{j+1}). Galvin proved that for any Borel coloring of triples of reals there is a perfect set P such that the color of any triple from P depends only on its type. Blass proved an analogous result is true for any n. As a corollary it follows that if the unordered n-tuples of reals are colored into finitely many Borel classes there is a perfect set P such that the n-tuples from P meet at most (n-1)! classes. We consider extensions of this result to partitions of infinite increasing sequences of reals. We show, that for any Borel or even analytic partition of all increasing sequences of reals there is a perfect set P such that all strongly increasing sequences from P lie in the same class.
math.LO↗
On the existence of atomic models
We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In particular, T(A) is a theory of size lambda where the principal types are dense, yet T(A) has no atomic model.
math.LO↗
Planting Kurepa trees and killing Jech-Kunen trees in a model by using one inaccessible cardinal
By an omega_1--tree we mean a tree of power omega_1 and height omega_1. Under CH and 2^{omega_1}> omega_2 we call an omega_1--tree a Jech--Kunen tree if it has kappa many branches for some kappa strictly between omega_1 and 2^{omega_1}. In this paper we prove that, assuming the existence of one inaccessible cardinal, (1) it is consistent with CH plus 2^{omega_1}> omega_2 that there exist Kurepa trees and there are no Jech--Kunen trees, (2) it is consistent with CH plus 2^{omega_1}= omega_4 that only Kurepa trees with omega_3 many branches exist.
math.LO↗
Combinatorial properties of Hechler forcing
In this work we use a notion of rank first introduced by James Baumgartner and Peter Dordal and later developed independently by the third author to show that adding a Hechler real has strong combinatorial consequences. We prove: 1) assuming omega_1^V = omega_1^L, there is no real in V[d] which is eventually different from the reals in L[d], where d is Hechler over V; 2) adding one Hechler real makes the invariants on the left-hand side of Cicho'n's diagram equal omega_1 and those on the right-hand side equal 2^omega and produces a maximal almost disjoint family of subsets of omega of size omega_1; 3) there is no perfect set of random reals over V in V[r][d], where r is random over V and d Hechler over V[r], thus answering a question of the first and second authors. As an intermediate step in the proof of 3) we show that given models M subseteq N of ZFC such that there is a perfect set of random reals in N over M, either there is a dominating real in N over M or mu (2^omega cap M) = 0 in N.
math.LO↗