Abstract
By now, we have assumed only that in every algebra we encounter there are a supremum and an infimum of each finite subset (likewise in a general lattice). We now strengthen the requirements on an algebra.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Vladimirov, D.A. (2002). Complete Boolean Algebras. In: Boolean Algebras in Analysis. Mathematics and Its Applications, vol 540. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0936-1_3
Download citation
DOI: https://doi.org/10.1007/978-94-017-0936-1_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5961-1
Online ISBN: 978-94-017-0936-1
eBook Packages: Springer Book Archive