scientific article; zbMATH DE number 4008461
A lattice with 0 is called dense if 0 is meet-irreducible. The author proves the following simple theorem: If L is a non trivial dense complete chain, the lattice morphisms from L to I (the real unit interval, with the usual order) separate the points (for every \(x<y\) in L there is a morphism f such that \(f(x)=0\) and \(f(y)=1).\) This result allows to strengthen results of G. N. Raney and more recently of Ph. Dwinger on the structure of the completely distributive complete lattices. The main result is the following theorem: (i) Every non trivial dense completely distributive complete lattice is a subdirect product of copies of I; (ii) Every non trivial completely distributive complete lattice is a subdirect product of copies of 2 (the two-element lattice) and I.
- Do we need complete-simple distributive lattices?
- Gamma invariants for dense lattices
- The structure of finite distributive lattices.
- Complete almost distributive lattices.
- An intrinsic characterization of completely distributive lattices and property P
- scientific article; zbMATH DE number 4212120 (Why is no real title available?)
- General distributivity in noncomplete lattices
- scientific article; zbMATH DE number 3912440 (Why is no real title available?)
- scientific article; zbMATH DE number 151679 (Why is no real title available?)
- scientific article; zbMATH DE number 465427 (Why is no real title available?)
- scientific article; zbMATH DE number 700545 (Why is no real title available?)
- scientific article; zbMATH DE number 1014389 (Why is no real title available?)
- scientific article; zbMATH DE number 1054167 (Why is no real title available?)
- scientific article; zbMATH DE number 1137988 (Why is no real title available?)
- scientific article; zbMATH DE number 1960899 (Why is no real title available?)
- The logic of information in state spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758894)