Minimally generated Boolean algebras

J. Baumgartner (1976) Almost disjoint sets, the dense set problem and the partition calculus, Ann. Math. Logic 9, 401?439.

G. Brenner (1983) A simple construction for rigid and weakly homogeneous Boolean algebras answering a question of Rubin, Proc. Amer. Math. Soc. 87, 601?606.

Th. Jech (1978) Set Theory, Academic Press, New York.

S. Koppelberg (1989a) General theory of Boolean algebras, in Handbook of Boolean Algebras (ed. J. D. Monk), North Holland, Amsterdam.

S. Koppelberg (1989b) Projective Boolean algebras, in Handbook of Boolean Algebras (ed. J. D. Monk), North Holland, Amsterdam, pp. 741?773.

S. Koppelberg (1988) Counterexamples in minimally generated Boolean algebras, Acta Universitatis Carolinae ? Math. Phys. 29(2), 27?36.

W. Mitchell (1972) Aronszajn trees and the independence of the transfer property, Ann. Math. Logic 5, 21?46.

S. Shelah (1981) On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements, Notre Dame J. Formal Logic 22, 301?308.

S. Todor?evi? (1984) Trees and linearly ordered sets, in Handbook of Set-Theoretic Topology (ed. K. Kunen and J. E. Vaughan), pp. 235?293.