Concrete quantum logics with covering properties

Pavel Pták

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini

Josef Tkadlec

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].

Jiří Binder, Mirko Navara

Let $L$ be a quantum logic and let $S(L)$ denote the set of all states on $L$. (By a state we mean a nonnegative bounded $\sigma$-additive measure, not necessarily normalized.) We ask whether every logic whose state space is a lattice has to be Boolean. We prove that this is so for finite logics and "projection logics." On the other hand, we show that there exist even concrete non-Boolean logics with a lattice state space (in fact, we prove that every countable concrete logic can be enlarged to a logic with a lattice state space). In the appendix we shortly consider the lattice properties of the set of observables and correct the paper [10].

PEKKA J. LAHTI

Ivanov, Al.

A class of quantum logics (orthomodular atomic lattices) is defined and studied. The obtained results suggest that the covering property acts as a selection criterion for theories in the sense that, given a set of orthomodular atomic lattices, those which may be theories for a fixed set of systems may be selected by verifyng if they have the covering property or not. A relation between physical meanings of the covering property, lattice - algebraic operations and the commutativity relation is also suggested