On the prime whales of a Boolean algebra (Q387432)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the prime whales of a Boolean algebra |
scientific article; zbMATH DE number 6242009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the prime whales of a Boolean algebra |
scientific article; zbMATH DE number 6242009 |
Statements
On the prime whales of a Boolean algebra (English)
0 references
23 December 2013
0 references
If \(B\) is a Boolean algebra and \(x\in B\) then \(U_1(x)\) denotes the set of all elements in the principal order filter \(U(x)\) generated by \(x\) except the largest element 1 of \(B\). A whale is an order ideal that has supremum equal to 1. A whale \(A\) is called prime if for every \(x\in B\) exactly one of the sets \(U_1(x)\) and \(U_1(x')\) is contained in \(A\). Using prime ideals, the author gives an alternative to Stone's representation theorem.
0 references
Boolean algebra
0 references
prime ideal
0 references
whale
0 references
order ideal
0 references
0.8713933
0 references
0 references
0.8601033
0 references
0.8589182
0 references
0.8542823
0 references