Concrete Quantum Logics with Generalised Compatibiliy
Type of document
ArticleAuthor
Tkadlec, Josef
Metadata
Show full item recordAbstract
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 partially a
question posed in [2].
Collections
The following license files are associated with this item: