Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Concrete Quantum Logics and Δ -Logics, States and Δ -States

Michal Hroch, Pavel Pták

Published Apr 5, 2017• 3 citations
Publisher
DOI
10.1007/s10773-017-3359-x

Related papers

Concrete Quantum Logics

Pavel Pták

International Journal of Theoretical Physics•Mar 1, 2000•25 citations

Concrete quantum logics with covering properties

Vladimir M�ller, Pavel Pt�k, Josef Tkadlec

International Journal of Theoretical Physics•May 1, 1992•14 citations

Concrete and abstract quantum computational logics

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

•Jan 1, 2007•0 citations

The Conditional in Abstract and Concrete Quantum Logic

Gary M. Hardegree

Springer eBooks•Jan 1, 1979•54 citations

Quantum Logics with Lattice State Spaces

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

Proceedings of the American Mathematical Society•Jan 1, 1987•5 citations

Quantum Logic and Related Systems

Akira Ocirc IDE

Annals of the Japan Association for Philosophy of Science•Jan 1, 1983•1 citation
Let LLL be a quantum logic and let S(L)S(L)S(L) denote the set of all states on LLL. (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].