On the prime whales of a Boolean algebra (Q387432): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Whales and the universal completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Whales and the orthocompletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Representation for Boolean Algebras / rank
 
Normal rank

Latest revision as of 04:11, 7 July 2024

scientific article
Language Label Description Also known as
English
On the prime whales of a Boolean algebra
scientific article

    Statements

    On the prime whales of a Boolean algebra (English)
    0 references
    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

    Identifiers