Concrete Quantum Logics with Generalised Compatibiliy

dc.contributor.author	Tkadlec, Josef
dc.date.accessioned	2015-10-09T08:22:20Z
dc.date.available	2015-10-09T08:22:20Z
dc.date.issued	1998
dc.identifier.issn	0862-7959
dc.identifier.uri	http://hdl.handle.net/10467/62427
dc.description.abstract	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].	cze
dc.language.iso	en	cze
dc.subject	Boolean algebra	cze
dc.subject	concrete quantum logic	cze
dc.subject	covering	cze
dc.subject	Jauch-Piron state	cze
dc.subject	orthocompleteness	cze
dc.title	Concrete Quantum Logics with Generalised Compatibiliy	cze
dc.type	Article	cze