Using whales to complete a Boolean algebra (Q1407454)
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: Using whales to complete a Boolean algebra |
scientific article; zbMATH DE number 1982136
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using whales to complete a Boolean algebra |
scientific article; zbMATH DE number 1982136 |
Statements
Using whales to complete a Boolean algebra (English)
0 references
28 January 2004
0 references
Let \(B\) be a Boolean algebra and \(A\) be a subset of \(B\). Then \(A\) is called a whale of \(B\) if (1) \(a\in A,\) \(b\in B\) and \(b \leq a\) imply \(b\in A\); (2) sup\(\{a \mid a\in A\}=1\). The author uses the whales of \(B\) to construct the completion of \(B\). This construction leads immediately to the assertion that any Boolean algebra can be represented as a dense subalgebra of all bands of an Archimedean Riesz space.
0 references
Boolean algebra
0 references
completion
0 references
Archimedean Riesz space
0 references
whale
0 references
bands
0 references