We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical logic which turns out to have disjoint distributive and nondistributive ortholattices. In particular, we prove that both classical logic and quantum logic are sound and complete with respect to each of these lattices. We also show that there is one common nonorthomodular lattice that is a model of both quantum and classical logic. In technical terms, that enables us to run the same classical logic on both a digital (standard, two-subset, 0-1-bit) computer and a nondigital (say, a six-subset) computer (with appropriate chips and circuits). With quantum logic, the same six-element common lattice can serve us as a benchmark for an efficient evaluation of equations of bigger lattice models or theorems of the logic.
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical logic which turns out to have disjoint distributive and nondistributive ortholattices. In particular, we prove that both classical logic and quantum logic are sound and complete with respect to each of these lattices. We also show that there is one common nonorthomodular lattice that is a model of both quantum and classical logic. In technical terms, that enables us to run the same classical logic on both a digital (standard, two-subset, 0-1-bit) computer and a nondigital (say, a six-subset) computer (with appropriate chips and circuits). With quantum logic, the same six-element common lattice can serve us as a benchmark for an efficient evaluation of equations of bigger lattice models or theorems of the logic.
According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.
Quantum logic is usually presented as a non-classical departure from ordinary reasoning forced on us by quantum mechanics, with classical logic kept as the secure starting point. We argue for the opposite order of explanation in a finite and fully computable setting. The free orthomodular lattice on two generators has ninety-six elements, the direct product of a six-element non-distributive factor and a sixteen-element Boolean factor. Reading the first factor as a register of contexts and the second as Boolean content, we obtain a calculus whose elements are context--bit-vector pairs and whose operations act component by component. With this calculus we establish three results. First, we classify the six layers by commutativity, identifying the central kernel of context-neutral propositions together with a dual central layer in which all complementary contexts are present. Second, we show that orthocomplementation rearranges the layers exactly as the complementation of the small factor rearranges its elements, which makes the duality among the layers rigid rather than accidental. Third, we prove that the operation forgetting the context is a surjective homomorphism of orthocomplemented lattices whose quotient is the classical Boolean algebra, so that classical logic is a six-to-one, information-losing image of the contextual calculus.
This article employs a descriptive-analytical method with an algebraic and axiomatic approach to address quantum logic. Through several thought experiments, it is demonstrated that the distributive law for propositions does not hold in quantum mechanics. Therefore, the logic governing this domain of science is not classical logic. In fact, the algebra corresponding to the logic of quantum propositions is an orthomodular lattice, which is why the distributive law is not necessarily valid for such propositions. In quantum logic, various definitions are offered for the implication operator. Since none of these operators satisfy the deduction theorem, a suitable implication operator with this property must be defined. This objective is achieved by defining a unified quantum logic. By constructing a Lindenbaum-Tarski algebra for this unified quantum logic, it can be shown that it is indeed a quantum logic. Dishkant presented an embedding of quantum logic into the Br-modal logic system. This provides an appropriate semantics for quantum logic. A suitable model for this logic is the closed subspaces of a Hilbert space.
Quantum Logic Distributivity And The Algebraic Structure Of Propositions As with many subatomic particles, the question of under what conditions the electron behaves as a particle or as a wave continues to be the subject of research. It was necessary to employ appropriate logic to organise the propositions describing the behaviour of such an object at the subatomic scale into a precise from and to establish coherent relationships between them. Quantum logic, which can be regarded as an interpretation of quantum mechanics, arose from this need. In classical mechanics, the state and properties of a system are described using the propositions of classical logic, which is based on Boolean algebra. In quantum mechanics, however, the fact that the operators representing the measured quantities do not commute has shown that quantum phenomena cannot be described using the propositions of classical logic. It is therefore necessary to have a formal framework suited to the propositions describing quantum phenomena. In our study, we highlight the various differences between classical logic and quantum logic, examine the distributive property and discuss, from the perspective of Birkhoff and von Neumann, the algebraic structure to which quantum logic might correspond. At the conclusion of our research, we find that, in order to assert that all experimental propositions logically equivalent to a given experimental proposition constitute a physical property, the operators corresponding to the measured quantities must commute with one another. Boolean algebra has an algebraic structure that allows classical logic to be formalised. In such algebra, the distributive property holds; thus, distributivity does not pose a problem for classical logic. Consequently, the distributive property does not always hold in quantum logic and quantum systems can be modelled using orthomodular lattices associated with closed subspaces of Hilbert space. We believe that this model must evolve in parallel with the discovery of new quantum phenomena and that it provides a framework conductive to this evolution. Keywords: Quantum logic; distributivity; partially order sets (posets); lattice; orthomodular lattice; Hilbert space; Boolean algebra.
We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic is a completion of the quantum logic QL. In other words, we refute Birkhoff and von Neumann's classic thesis that the logic (the formal character) of Quantum Mechanics would be non-classical as well as Putnam's thesis that quantum logic (of his kind) would be the correct logic for propositional inference in general. The propositional logic of Quantum Mechanics is modal but classical, and the correct logic for propositional inference need not have an extroverted quantum character. One normal necessity modality suffices to capture the subjectivity of observation in quantum experiments, and this thanks to its failure to distribute over classical disjunction. The key to our result is the translation of quantum negation as classical negation of observability.
This paper examines how logical structures represent sharp and unsharp propositions in classical and quantum systems. Classical sharp logic is modeled by Boolean algebras, where propositions have bivalent truth values, complements are globally defined, and distributivity holds. Quantum sharp logic is modeled by orthomodular lattices of closed Hilbert-space subspaces or projection operators; it retains definite yes–no outcomes for ideal measurements but rejects the Boolean assumptions of global truth valuation and distributivity. Classical unsharp logic uses fuzzy membership or probabilistic truth values to describe vagueness and incomplete information, whereas quantum unsharp logic is expressed through effects and effect algebras, which capture noisy, inefficient, and generalized measurements. The paper’s central question is which algebraic structure is appropriate for each combination of classical or quantum behavior and sharp or unsharp measurement. The analysis shows that the four cases form a coherent hierarchy: Boolean algebras describe deterministic classical events, orthomodular lattices describe ideal quantum propositions, fuzzy or probabilistic models describe classical partial truth, and effect algebras describe realistic quantum effects. This classification clarifies the mathematical and physical role of unsharpness and explains why effect algebras are needed beyond projection-based quantum logic.