𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chains in Boolean Semigroup Algebras

✍ Scribed by Lutz Heindorf

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
227 KB
Volume
37
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

BOOLEAN ALGEBRAS IN AST
BOOLEAN ALGEBRAS IN AST
✍ Klaus Schumacher πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 489 KB

## Abstract In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean alge

Reduced Idempotents in the Semigroup of
Reduced Idempotents in the Semigroup of Boolean Matrices
✍ Janusz Konieczny πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 368 KB

We present an algorithm that generates all reduced idempotents in the semigroup of \(n \times n\) Boolean matrices. As a consequence, we obtain a method of listing all partial order relations on a finite set with \(n\) elements.

Dense subtrees in complete Boolean algeb
Dense subtrees in complete Boolean algebras
✍ Bernhard KΓΆnig πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 94 KB πŸ‘ 1 views

## Abstract We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras. (Β© 2006 WILEY‐VCH

On Modular Homology in the Boolean Algeb
On Modular Homology in the Boolean Algebra
✍ Valery Mnukhin; Johannes Siemons πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 165 KB

Let ⍀ be a set, R a ring of characteristic p ) 0, and denote by M the k R-module with k-element subsets of ⍀ as basis. The set inclusion map is the homomorphism which associates to a k-element subset ⌬ the sum q⌫ of all its k y 1 -element subsets ⌫ . In this paper we arising from Ρ¨. We introduce

Long Symmetric Chains in the Boolean Lat
Long Symmetric Chains in the Boolean Lattice
✍ BΓ©la Bajnok; Shahriar Shahriari πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 316 KB

Let 2 [n] be the poset of all subsets of a set with n elements ordered by inclusion. A long chain in this poset is a chain of n&1 subsets starting with a subset with one element and ending with a subset with n&1 elements. In this paper we prove: Given any collection of at most n&2 skipless chains in