๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The boolean hierarchy of NP-partitions

โœ Scribed by Sven Kosub; Klaus W. Wagner

Book ID
113641705
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
448 KB
Volume
206
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partitions of large Boolean lattices
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

Selection of partitions from a hierarchy
Selection of partitions from a hierarchy
โœ Shi Xu; Markad V. Kamath; David W. Capson ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 522 KB
Minimum-sized Infinite Partitions of Boo
Minimum-sized Infinite Partitions of Boolean Algebras
โœ J. Donald Monk ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

## Abstract For any Boolean Algebra __A__, let c~mm~(__A__) be the smallest size of an infinite partition of unity in __A.__ The relationship of this function to the 21 common functions described in Monk [4] is described, for the class of all Boolean algebras, and also for its most important subcla