Constructions of many complicated uncountable structures and Boolean algebras
type: Item
instance of: scholarly article
title: Constructions of many complicated uncountable structures and Boolean algebras
zbMATH Open document ID: 0552.03018
DOI: 10.1007/BF02774012
author: S. Shelah
published in: Israel Journal of Mathematics
publication date: 1983-01-01T00:00:00Z
review text: A class \({\mathcal K}\) of models has the \((\alpha,\beta,\gamma,\delta)-\psi - \)bigness property iff there are \(I_ i\in {\mathcal K}\), \(i<\alpha\), \(| I_ i| =\beta\) and for different \(i,j<\alpha\), \(I_ i\) is not embeddable in \(I_ j\) in a strong sense (depending on \(\gamma\), \(\delta\), \(\psi)\). This notion is a refinement of the cardinal characteristic \(IE(\beta,T_ 1,T)\) from \textit{S. Shelah's} book ''Classification theory and the number of non-isomorphic models'' (1978; Zbl 0388.03009). The author shows that some special classes of models possess various bigness properties. Using this, many interesting Boolean algebras are constructed. A typical result is the following theorem: For every uncountable regular cardinal \(\alpha\) there is a rigid Boolean algebra B of power \(\alpha\) satisfying C.C.C. such that B has no one-to-one endomorphism different from the identity and for any a,b\(\in B\), \(0\neq a\nleq b\), \(B| a\) cannot be embedded in \(B| b.\) A Boolean algebra B is said to be \(\alpha\)-narrow if among any \(\alpha\) elements of B, two are comparable. The author shows that an \(\alpha\)- narrow Boolean algebra has a dense subset of power less than \(\alpha\) [for \(\alpha\) regular, see \textit{J. Baumgartner} and \textit{P. Komjáth}, Fundam. Math. 111, 125-133 (1981; Zbl 0452.03044)]. The existence of an endo-rigid, Bonnet-rigid indecomposable Boolean algebra of power \(\aleph_ 1\) is investigated under some additional set theoretic assumptions.
Mathematics Subject Classification ID: 03C52
Mathematics Subject Classification ID: 03C30
Mathematics Subject Classification ID: 06E05
zbMATH DE Number: 3878902
zbMATH Keywords: bigness properties
zbMATH Keywords: rigid Boolean algebra
zbMATH Keywords: narrow Boolean algebra
zbMATH Keywords: indecomposable Boolean algebra
reviewed by: Lev Bukovský
MaRDI profile type: Publication
cites work: Boolean algebras in which every chain and antichain is countable
cites work: Very strongly rigid Boolean algebras, continuum discrete set condition, countable antichain condition. I
cites work: Some questions about Boolean algebras
cites work: Some theorems of set theory and their topological consequences
cites work: Between Martin's Axiom and Souslin's Hypothesis
cites work: Borel determinacy
cites work: A very rigid Boolean algebra
cites work: Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees
cites work: Q4132524
cites work: Classification theory and the number of non-isomorphic models
cites work: Jonsson algebras in successor cardinals
cites work: Boolean Algebras with Few Endomorphisms
cites work: Remarks on Boolean algebras
cites work: Iterated forcing and changing cofinalities
cites work: Iterated Cohen extensions and Souslin's problem
cites work: Infinite Abelian groups, Whitehead problem and some constructions
Recommended article: Categoricity and ranks
Recommended article: An exposition of Shelah's 'main gap': counting uncountable models of \(\omega\)-stable and superstable theories
Recommended article: Classification of first order theories which have a structure theorem
Recommended article: Around classification theory of models
Recommended article: Classification theory and the number of non-isomorphic models.
Recommended article: On potential isomorphism and non-structure
Recommended article: Forcing isomorphism II
Recommended article: Q3344182
Recommended article: Q5065369
Recommended article: A proof of morley's conjecture
description: scientific article; zbMATH DE number 3878902