The Uniqueness Of The Decomposition Of Distributive Lattices Into Sums Of Boolean Lattices

Reports on Mathematical Logic:93-102 (1997)
  Copy   BIBTEX

Abstract

We prove that any decomposition of any finite distributive lattice into Boolean algebras contains all maximal Boolean fragments of the lattice. The maximal elements of the decomposition are thus uniquely determined. We also exhibit a practical method of finding them.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references