Abstract
This article has three aims: (1) To make the results of [12, VIII] on constructing models more available for application, by separating the combinatorial parts. Thus in applications one will only need the relevant things from the area of application. (2) To strengthen the results there. In particular, we were mainly interested in [12, VIII] in showing that there are many isomorphism types of models of an unsuperstable theory, with results about the number of models not elementarily embeddable in each other being a side benefit. Here we consider the latter case in more detail, getting more cases. We also consider some more complicated constructions along the same lines % MathType!MTEF!2!1!+-\((K_{ptr}^\omega )\). (3) To solve various problems from the list of van Dowen, Monk and Rubin [3] on Boolean algebras, which was presented at a conference on Boolean algebra in Oberwolfach January 1979 (most of the solutions are mentioned in the final version). Some of them are not related to (1) and (2). This continues [10, §2] in which the existence of a rigid B.A. in every uncountable power was proved. There (and also here) we want to demonstrate the usefulness of the methods developed in [12, VIII] (and §§ 1,2) for getting many (rigid) non-embeddable models in specific classes.
Similar content being viewed by others
References
J. Baumgartner and P. Komjath,Boolean algebras in which every chain and every antichain is countable, Fundam. Math.61 (1981), 125–133.
R. Bonnet,Very strongly rigid Boolean algebras, continuum discrete set condition, countable antichain condition, Algebra Univ., to appear.
E. C. K. van Douwen, J. D. Monk and M. Rubin,Some questions about Boolean algebras, Algebra Univ.11 (1980), 220–243.
R. Engelking and M. Karłowicz,Some theorems of set theory and their topological consequences, Fund. Math.57 (1965), 275–285.
K. Kunen and F. D. Tall,Between Martin’s axiom and Souslin’s Hypothesis, Fund. Math.102 (1979), 173–181.
D. A. Martin,Borel determinacy, Ann. of Math.102 (1975), 363–371.
J. D. Monk,A very rigid Boolean algebra, Isr. J. Math.35 (1980), 135–150.
M. Rubin,On Boolean algebras with few endomorphisms, Trans. Am. Math. Soc., to appear.
M. Rubin and S. Shelah,Combinatorial problems on trees, partitions, Δ-systems and large free subsets, Ann. Math. Log., to appear.
S. Shelah,Why there are many non-isomorphic models for unsuperstable theories, Proc. of the International Congress of Math., Vancouver, 1974, pp. 553–557.
S. Shelah,The lazy model theorist guide to stability, Logique et Analyse71–72 (1975), 241–308; also inSix Days of Model Theory, Proc. of a Conference in Louvain-la-Neuve, March 75 (P. Henrard ed.), Paul Castella, Switzerland 1661 Albeuve, 1978, pp. 9–76.
S. Shelah,Classification Theory, North-Holland Publ. Co., Amsterdam, 1978.
S. Shelah,Jonsson algebras in successor cardinals, Isr. J. Math.,30 (1978), 57–64.
S. Shelah,Boolean algebras with few endomorphisms, Proc. Am. Math. Soc.74 (1979), 135–142.
S. Shelah,Remarks on Boolean algebras, Algebra Univ.11 (1980), 77–89.
S. Shelah,Iterated forcing and changing cofinalities, Isr. J. Math.40 (1981), 1–32; also Chapter X inProper Forcing, Lecture Notes in Math., No. 940, Springer-Verlag, Berlin, 1982.
S. Shelah,Iterated forcing and changing cofinalities II, Chapter XI inProper Forcing, Lecture Notes in Math., No. 940, Springer-Verlag, Berlin, 1982.
S. Shelah,Uncountable constructions, Isr. J. Math., submitted.
R. M. Solovay and S. Tenenbaum,Iterated Cohen extension and the Souslin problem, Ann. of Math.94 (1971), 201–245.
S. Shelah,Infinite Abelian groups, Whitehead problem and some constructions, Isr. J. Math.18 (1974), 243–256.
Author information
Authors and Affiliations
Additional information
The author thanks Don Monk for refereeing this paper very carefully, detecting many errors, adding many details, and shortening the proof of Theorem 4.1; and Rami Grossberg for carefully proofreading the paper.
This research was partially supported by the United States-Israel Binational Science Foundation.
Rights and permissions
About this article
Cite this article
Shelah, S. Constructions of many complicated uncountable structures and Boolean algebras. Israel J. Math. 45, 100–146 (1983). https://doi.org/10.1007/BF02774012
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02774012