✦ LIBER ✦

An extension of Boolean lattice theory

✍ Scribed by N. V. Subrahmanyam

Publisher: Springer
Year: 1963
Tongue: English
Weight: 848 KB
Volume: 151
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01470824

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean Topological Distributive Lattice

Boolean Topological Distributive Lattices and Canonical Extensions

✍ B. A. Davey; M. Haviar; H. A. Priestley 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

Cutsets of Boolean lattices

✍ Richard Nowakowski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F U {a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined

OnLα,ωcomplete extensions of complete th

OnLα,ωcomplete extensions of complete theories of Boolean algebras

✍ Matatyahu Rubin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 193 KB

Annihilator characterizations of Boolean

Annihilator characterizations of Boolean rings and Boolean lattices

✍ E. M. Vechtomov 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 483 KB

Minimum cutsets for an element of a bool

Minimum cutsets for an element of a boolean lattice

✍ Jerrold R. Griggs; Daniel J. Kleitman 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 364 KB

Partitions of large Boolean lattices

✍ Zbigniew Lonc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Let 2" be the ordered set obtained from the Boolean lattice 2" by deleting both the greatest and the least elements. Definef(n) to be the minimum number k such that there is a partition of 2" into k antichains of the same size except for at most one antichain of a smaller size. In the paper we exami