Completeness in sums of Boolean algebras and logics (Q685161)
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: Completeness in sums of Boolean algebras and logics |
scientific article; zbMATH DE number 417098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness in sums of Boolean algebras and logics |
scientific article; zbMATH DE number 417098 |
Statements
Completeness in sums of Boolean algebras and logics (English)
0 references
30 September 1993
0 references
The authors investigate ``free'' sums of Boolean algebras and quantum logics. They prove as a main result that the sum is never complete if at least one of the summands is infinite (both summands are supposed to be atomic). They also provide an analysis of the MacNeille completion of a sum.
0 references
Boolean power
0 references
completeness in orthomodular lattices
0 references
free sums of Boolean algebras
0 references
MacNeille completion
0 references
0.8471586108207703
0 references
0.7811253666877747
0 references
0.7797222137451172
0 references
