Complete lattices are studied which contain an element u which is not the join of a finite set of smaller elements, but is the join of all elements cu.
Join-Irreducible Boolean Functions
โ Scribed by Moncef Bouaziz; Miguel Couceiro; Maurice Pouzet
- Publisher
- Springer Netherlands
- Year
- 2010
- Tongue
- English
- Weight
- 463 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
After providing a simple characterization of Horn functions (i.e., those Boolean functions that have a Horn DNF), we study in detail the special class of submodular functions. Every prime implicant of such a function involves at most one complemented and at most one uncomplemented variable, and base
The group of congruences and permutations of the two-colored N-dimensional Boolean cube is considered. The total number of orbits generated by these automorphisms are shown to scale as 22"/(2y+'N!) when N tends to infinity. The probability that a randomly chosen function will belong to an orbit cont