The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
The term proposition usually denotes in quantum mechanics (QM) an element of (standard) quantum logic (QL). Within the orthodox interpretation of QM the propositions of QL cannot be associated with sentences of a language stating properties of individual samples of a physical system, since properties are nonobjective in QM. This makes the interpretation of propositions problematical. The difficulty can be removed by adopting the objective interpretation of QM proposed by one of the authors (semantic realism, or SR, interpretation). In this case, a unified perspective can be adopted for QM and classical mechanics (CM), and a simple first order predicate calculus L(x) with Tarskian semantics can be constructed such that one can associate a physical proposition (i.e., a set of physical states) with every sentence of L(x). The set Pf of all physical propositions is partially ordered and contains a subset PTf of testable physical propositions whose order structure depends on the criteria of testability established by the physical theory. In particular, PTf turns out to be a Boolean lattice in CM, while it can be identified with QL in QM. Hence the propositions of QL can be associated with sentences of L(x), or also with the sentences of a suitable quantum language LTQ(x), and the structure of QL characterizes the notion of testability in QM. One can then show that the notion of quantum truth does not conflict with the classical notion of truth within this perspective. Furthermore, the interpretation of QL propounded here proves to be equivalent to a previous pragmatic interpretation worked out by one of the authors, and can be embodied within a more general perspective which considers states as first order predicates of a broader language with a Kripkean semantics.
The non-classical nature of quantum theory has led to a number of efforts to formalize the logic of statements whose universe of discourse is the subatomic (see, for example, [3], [6], [8], and [10]).It might be hoped that ideally the fruit of such efforts would be a formalism not totally divorced from the classical logic, but incorporating or incorporated in it in such a manner as to unify the logic of the micro-and the macro-worlds.Indeed, this has been the general direction taken by these efforts, including that which we principally examine and expand upon here.*Josef Jauch, [6], pp.67-89, developed a "propositional calculus of quantum mechanics".He objected to calling a system like his a "logic of quantum mechanics"; however, our use of 'logic' here is not, I think, the use to which Jauch objected.A logic, for our present purposes, is a mathematical formalism having a reasonable interpretation as a theory of deduction; its actual application as normative of argumentation in reality is a matter of empirical judgment.This seems close to the way Jauch wished to use "propositional calculus" but more general, allowing for extension to a quantification theory of quantum mechanics, for example.Although Jauch's presentation of a propositional calculus of quantum mechanics is mathematically interesting and suggestive, there are a number of problems connected with it.It is our purpose to engage some of these problems and to present a rigorously defined formalism intended to come close to doing the job intended by Jauch for his logic.The success or lack of success of this effort as related to actual application of this formalism in the foundations of quantum theory is, I think, a matter for the physicists to decide; the empirical judgment involved in this application is not in the scope of this paper.If a formalism is to have a reasonable interpretation as a theory of deduction, it seems clear that it must include a relation which, when it holds between two elements of the formalism, may be reasonably interpreted as expressing that one of the elements 'follows from' the other, in •The author wishes to thank Robert Piziak for advice and comments in the course of research for this paper.
Abstract With many physical processes in which quantum mechanical phenomena can occur, it is essential to take into account a decision mechanism based on measurement data. This can be achieved by means of so-called numerical events, which are specified as follows: Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s∈S s ∈ S . A function p:S→[0,1] p : S → [ 0 , 1 ] is called a numerical event or alternatively, an S-probability. If a set P of S-probabilities is ordered by the order of real functions, it becomes a poset which can be considered as a quantum logic. In case the logic P is a Boolean algebra, this will indicate that the underlying physical system is a classical one. The goal of this paper is to study sets of S-probabilities which are not far from being Boolean algebras by means of the addition and comparison of functions that occur in these sets. In particular, certain classes of so-called Boolean posets of S-probabilities are characterized and related to each other and descriptions based on sets of states are derived.
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.