1969
DOI: 10.1017/s0004972700041526
|View full text |Cite
|
Sign up to set email alerts
|

The completion by cuts of an orthocomplemented modular lattice

Abstract: In this note we give an example of an orthocomplemented modular lattice whose completion by cuts is not orthomodular. This solves negatively Problem 36, p. 131, in G. Birkhoff: Lattice theory (3rd edition).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

1990
1990
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 2 publications
0
10
0
Order By: Relevance
“…(1) Obvious. (2) Every ortholattice with more than one element contains a two element Boolean algebra as a subalgebra, and the two element Boolean algebra generates the variety of Boolean algebras.…”
Section: Proposition 71 (1) the Trivial Variety Is The Smallest Varimentioning
confidence: 99%
“…(1) Obvious. (2) Every ortholattice with more than one element contains a two element Boolean algebra as a subalgebra, and the two element Boolean algebra generates the variety of Boolean algebras.…”
Section: Proposition 71 (1) the Trivial Variety Is The Smallest Varimentioning
confidence: 99%
“…an orthoposet being a lattice) the orthocomplementation on which extends the orthocomplementation of Ρ (see [4, p. 255-256]). In contrast to this fact the MacNeille completion of even a modular ortholattice need not be orthomodular (see [1]). In quantum probability theory an important question seems to be orthocompleteness of orthomodular posets.…”
Section: The Macneille Completion and Orthocompletionmentioning
confidence: 99%
“…Then for every «i, «2 € H and every a £ A Kl , b £ A KJ we have a ^ b 1 -. Now let us denote F = { x E L | x = 0 or x is a join of a finite set of atoms in 1 } and L ={y £ L \ either y E F or y 1 (in L). Using Theorems 3.1 and 3.3 we obtain a Kn ->0 (in L).…”
Section: Order Topological O M L S In the Language Of Filters; Countementioning
confidence: 99%
“…A well-known fact is that the MacNeille completion of an orthomodular lattice L need not be orthomodular, even if L is a modular ortholattice ( [1,5] and others). Little is known about completions of orthomodular lattices (abbreviated OMLs).…”
Section: Introductionmentioning
confidence: 99%