Towers and maximal chains in Boolean algebras (Q997119)

A tower in a Boolean algebra \(A\) is a strictly increasing sequence of regular length of elements of \(A\) with supremum 1. The spectrum of towers of a Boolean algebra \(A\) is the set \(\{ | T| : T\) is a tower in \(A \}\) and the length spectrum of \(A\) is the set \(\{ | C| : C\) is a maximal chain in \(A\}\). The author investigates the behaviour of these two functions under weak direct products and free products. He shows that for each nonempty set \(K\) of regular cardinals (1) there is an atomless Boolean algebra \(A\) with spectrum \(K\) and (2) under GCH there is an atomless Boolean algebra \(A\) with length spectrum \(K\).