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.
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.
List of Figures. List of Tables. Preface. Acknowledgements. I: Mathematical and Physical Background. Introduction. 1. The mathematical scenario of quantum theory and von Neumann's axiomatization. 1.1. Algebraic structures. 1.2. The geometry of quantum theory. 1.3. The axiomatization of orthodox QT. 1.4. The 'logic' of the quantum events. 1.5. The logico-algebraic approach to QT. 2. Abstract axiomatic foundations of sharp QT. 2.1. Mackey's minimal axiomatization of QT. 2.2. Events. 2.3. Event-state systems. 2.4. Event-state systems and preclusivity spaces. 3. Back to Hilbert space. 3.1. Events as closed subspaces. 3.2. Events as projections. 3.3. Hilbert event-state systems. 3.4. From abstract orthoposets of events to Hilbert lattices. 4. The emergence of fuzzy events in Hilbert space quantum theory. 4.1. The notion of effect. 4.2. Effect-Brouwer Zadeh posets. 4.3. MacNeille completions. 4.4. Unsharp preclusivity spaces. 5. Effect algebras and quantum MV algebras. 5.1. Effect algebras and Brouwer Zadeh effect algebras. 5.2. The Lukasiewwicz operations. 5.3. MV algebras and QMV algebras. 5.4. Quasi-linear QMV algebras and effect algebras. 6. Abstract axiomatic foundations of unsharp quantum theory. 6.1. A minimal axiomatization of unsharp QT. 6.2. The algebraic structure of abstract effects. 6.3. The sharply dominating principle. 6.4. Abstract unsharp preclusivity spaces. 6.5. Sharp and unsharp abstract quantum theory. 7. To what extent is quantum ambiguity ambiguous? 7.1. Algebraic notions of 'sharp'. 7.2. Probabilistic definitions of 'sharpness'. II: Quantum Logics as Logic. Introduction. 8. Sharp quantum logics. 8.1. Algebraic and Kripkean semantics for sharp quantum logics. 8.2. Algebraic and Kripkean realizations of Hilbert event-state systems. 8.3. The implication problem in quantum logic. 8.4. Five polynomial conditions. 8.5. The quantum logical conditional as a counterfactual conditional. 8.6. Implication-connectives. 9. Metalogical properties and anomalies of quantum logic. 9.1. The failure of the Lindenbaum properety. 9.2. A modal interpretation of sharp quantum logics. 10. An axiomatization of OL and OQL. 10.1. The calculi of OL and OQL. 10.2. The soundness and completeness theorems. 11. The metalogical intractability of orthomodularity. 11.1. Orthomodularity is not elementary. 11.2. The embeddability problem. 11.3. Hilbert quantum logic and the orthomodular law. 12. First-order quantum logics and quantum set theories. 12.1. First-order semantics. 12.2. Quantum set theories. 13. Partial classical logic, the Lindenbaum property and the hidden variable problem. 13.1. Partial classical logic. 13.2. Partial classical logic and the Lindenbaum property. 13.3. States on partial Boolean algebras. 13.4. The Lindenbaum property and the hidden variable problem. 14. Unsharp quantum logics. 14.1.
The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is (i) bivalent, i.e., the value 1 (true) or 0 (false) is assigned to each proposition, and (ii) truth-functional, i.e., the logical operations are preserved. In addition, this set must be "full", i.e., any pair of distinct propositions is assigned different values by some mapping in the set. When the propositions make assertions about the properties of classical or of quantum systems, the mappings should also be (iii) "state-induced", i.e., values assigned by the semantics should accord with values assigned by classical or by quantum mechanics. In classical propositional logic, (equivalence classes of) propositions form a Boolean algebra, and each semantic mapping assigns the value 1 to the members of a certain subset of the algebra, namely, an ultrafilter, and assigns 0 to the members of the dual ultraideal, where the union of these two subsets is the entire algebra. The propositional structures of classical mechanics are likewise Boolean algebras, so one can straightforwardly provide a classical semantics, which also satisfies (iii). However, quantum propositional structures are non-Boolean, so it is an open question whether a semantics satisfying (i), (ii) and (iii) can be provided. Von Neumann first proposed (1932) that the algebraic structures of the subspaces (or projectors) of Hilbert space be regarded as the pro-positional structures PQM of quantum mechanics. These structures have been formalized in two ways: as orthomodular lattices which have the binary operations "and", "or", defined among all elements, compatible [symbol omitted] and incompatible [symbol omitted]; and as partial-Boolean algebras which have the binary operations defined among only compatible elements. In the thesis, two basic senses in which these structures are non-Boolean are discriminated. And two notions of truth-functionality are distinguished: truth-functionality [symbols omitted] applicable to the PQM lattices; and truth-functionality [symbol omitted] applicable to both the lattices and partial-Boolean algebras. Then it is shown how the lattice definitions of "and", "or", among incompatibles rule out a bivalent, truth-functional [symbols omitted] semantics for any lattice containing incompatible, elements. In contrast, the Gleason and Kochen-Specker proofs of the impossibility of hidden-variables for quantum mechanics show the impossibility of a bivalent, truth-functional [symbol omitted] semantics for three-or-higher dimensional Hilbert space structures; and the presence of incompatible elements is necessary but is not sufficient to rule out such a semantics. As for (iii), each quantum state-induced expectation-function on a PQM truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of PQM³ where, in general the union of an ultrafilter and its dual ultraideal is smaller than the entire structure. Thus it is argued that each expectation-function is the quantum analog of a classical semantic mapping, even though the domain where each expectation-function is bivalent and truth-functional is usually a non-Boolean substructure of PQM. The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed.
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 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.
Due to the failure of the classical principles of bivalence and verifunctionality, the logic of experimental propositions relative to quantum systems cannot be interpreted in Boolean algebras. However, we cannot say neither that this logic is captured by orthomodular lattices, as claimed by many authors along the line of Birkhoff's and von Neumann's standard approach. For the alleged violation of distributivity is based on the possibility of combining statements relative to complementary contexts, which does not refer to any experience and, consequently, has no meaning. Indeed, quantum logic should be interpreted in partial, transitive Boolean algebras whose compatibility relation limits the application of the connectives within each of its Boolean sub-algebras, which refer to partial, classical descriptions. Moreover, this approach of quantum logic makes it possible to deal with composite systems, which was not possible to do within the standard approach, and then to deal with the fundamental notion of quantum entanglement. The latter notion can be represented by a series of axioms of the object language that restrict the set of experimental statements bearing on a composite system, while its close link to the notion of complementarity can be expressed in the metalanguage.
Intuitionistic logic, in which the double negation law not-not-P = P fails, is dominant in categorical logic, notably in topos theory. This paper follows a different direction in which double negation does hold. The algebraic notions of effect algebra/module that emerged in theoretical physics form the cornerstone. It is shown that under mild conditions on a category, its maps of the form X -> 1+1 carry such effect module structure, and can be used as predicates. Predicates are identified in many different situations, and capture for instance ordinary subsets, fuzzy predicates in a probabilistic setting, idempotents in a ring, and effects (positive elements below the unit) in a C*-algebra or Hilbert space. In quantum foundations the duality between states and effects plays an important role. It appears here in the form of an adjunction, where we use maps 1 -> X as states. For such a state s and a predicate p, the validity probability s |= p is defined, as an abstract Born rule. It captures many forms of (Boolean or probabilistic) validity known from the literature. Measurement from quantum mechanics is formalised categorically in terms of `instruments', using L\"uders rule in the quantum case. These instruments are special maps associated with predicates (more generally, with tests), which perform the act of measurement and may have a side-effect that disturbs the system under observation. This abstract description of side-effects is one of the main achievements of the current approach. It is shown that in the special case of C*-algebras, side-effect appear exclusively in the non-commutative case. Also, these instruments are used for test operators in a dynamic logic that can be used for reasoning about quantum programs/protocols. The paper describes four successive assumptions, towards a categorical axiomatisation of quantitative logic for probabilistic and quantum systems.