Concrete quantum logics with generalised compatibility
Josef Tkadlec (1998)
Mathematica Bohemica
Similarity:
We present three results stating when a concrete (=set-representable) quantum logic with covering properties (generalization of compatibility) has to be a Boolean algebra. These results complete and generalize some previous results [3, 5] and answer partiallz a question posed in [2].