Semisimple completely distributive lattices are Boolean algebras
HTML articles powered by AMS MathViewer
- by M. S. Lambrou PDF
- Proc. Amer. Math. Soc. 68 (1978), 217-219 Request permission
Erratum: Proc. Amer. Math. Soc. 73 (1979), 405.
Abstract:
Semisimple completely distributive lattices are Boolean algebras.References
- Garrett Birkhoff, Lattice Theory, American Mathematical Society, New York, 1940. MR 0001959
- Paul R. Halmos, Lectures on Boolean algebras, Van Nostrand Mathematical Studies, No. 1, D. Van Nostrand Co., Inc., Princeton, N.J., 1963. MR 0167440
- M. S. Lambrou, Complete atomic Boolean lattices, J. London Math. Soc. (2) 15 (1977), no. 3, 387–390. MR 444541, DOI 10.1112/jlms/s2-15.3.387
- W. E. Longstaff, Strongly reflexive lattices, J. London Math. Soc. (2) 11 (1975), no. 4, 491–498. MR 394233, DOI 10.1112/jlms/s2-11.4.491
- George N. Raney, A subdirect-union representation for completely distributive complete lattices, Proc. Amer. Math. Soc. 4 (1953), 518–522. MR 58568, DOI 10.1090/S0002-9939-1953-0058568-4
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 68 (1978), 217-219
- MSC: Primary 06A35; Secondary 06A23
- DOI: https://doi.org/10.1090/S0002-9939-1978-0463067-9
- MathSciNet review: 0463067