Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brenner, G. A simple construction for rigid and weakly homogeneous Boolean algebras answering a question of Rubin, to appear, Proc. AMS.
Horn, A. and Tarski, A. Measures in Boolean algebras, Trans. AMS 64(1948), 467–497.
McKenzie, R. and Monk, J.D. Chains in Boolean algebras, to appear, Ann. Math. Logic.
Rabin, M.O. Decidability of second-order theories and automata on infinite trees, Trans. AMS 14(1969), 1–35.
Rubin, M. A Boolean algebra with few subalgebras, interval algebras and retractiveness, preprint.
Shelah, S. Constructions of many complicated uncountable structures and Boolean algebras, preprint.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Brenner, G., Monk, D. (1983). Tree algebras and chains. In: Freese, R.S., Garcia, O.C. (eds) Universal Algebra and Lattice Theory. Lecture Notes in Mathematics, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0063429
Download citation
DOI: https://doi.org/10.1007/BFb0063429
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12329-3
Online ISBN: 978-3-540-40954-0
eBook Packages: Springer Book Archive