Partial Boolean Algebras Research Articles

Quantum cognition and bounded rationality

We consider several puzzles of bounded rationality. These include the Allais- and Ellsberg paradox, the disjunction effect, and related puzzles. We argue that the present account of quantum cognition—taking quantum probabilities rather than classical probabilities—can give a more systematic description of these puzzles than the alternate treatments in the traditional frameworks of bounded rationality. Unfortunately, the quantum probabilistic treatment does not always provide a deeper understanding and a true explanation of these puzzles. One reason is that quantum approaches introduce additional parameters which possibly can be fitted to empirical data but which do not necessarily explain them. Hence, the phenomenological research has to be augmented by responding to deeper foundational issues. In this article, we make the general distinction between foundational and phenomenological research programs, explaining the foundational issue of quantum cognition from the perspective of operational realism. This framework is motivated by assuming partial Boolean algebras (describing particular perspectives). They are combined into a uniform system (i.e. orthomodular lattice) via a mechanism preventing the simultaneous realization of perspectives. Gleason’s theorem then automatically leads to a distinction between probabilities that are defined by pure states and probabilities arising from the statistical mixture of pure states. This formal distinction relates to the conceptual distinction between risk and ignorance. Another outcome identifies quantum aspects in dynamic macro-systems using the framework of symbolic dynamics. Finally, we discuss several ideas that are useful for justifying complementarity in cognitive systems.

CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS

AbstractThe history of productivity of theκ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal$\kappa > \aleph _1 {\rm{,}}$the principle □(k) is equivalent to the existence of a certain strong coloring$c\,:\,[k]^2 \, \to $kfor which the family of fibers${\cal T}\left( c \right)$is a nonspecialκ-Aronszajn tree.The theorem follows from an analysis of a new characteristic function for walks on ordinals, and implies in particular that if theκ-chain condition is productive for a given regular cardinal$\kappa > \aleph _1 {\rm{,}}$thenκis weakly compact in some inner model of ZFC. This provides a partial converse to the fact that ifκis a weakly compact cardinal, then theκ-chain condition is productive.

Bohrification of operator algebras and quantum logic

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to be families of projections indexed by a partially ordered set $${\mathcal{C}(A)}$$ of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that $${\mathcal{C}(A)}$$ consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Heyting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n × n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski–Mulvey) of the “Bohrification” $${\underline A}$$ of A, which is a commutative Rickart C*-algebra in the topos of functors from $${\mathcal{C}A}$$ to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns–Lakser completions. Finally, we establish a connection between probability measures on the lattice of projections on a Hilbert space H and probability valuations on the internal Gelfand spectrum of $${\underline A}$$ for A = B(H).

Noncommutativity as a Colimit

Every partial algebra is the colimit of its total subalgebras. We prove this result for partial Boolean algebras (including orthomodular lattices) and the new notion of partial C*-algebras (including noncommutative C*-algebras), and variations such as partial complete Boolean algebras and partial AW*-algebras. The first two results are related by taking projections. As corollaries we find extensions of Stone duality and Gelfand duality. Finally, we investigate the extent to which the Bohrification construction, that works on partial C*-algebras, is functorial.

Partial quantum logics revisited

Partial Boolean algebras (PBAs) were introduced by Kochen and Specker as an algebraic model reflecting the mutual relationships among quantum-physical yes–no tests. The fact that not all pairs of tests are compatible was taken into special account. In this paper, we review PBAs from two sides. First, we generalise the concept, taking into account also those yes–no tests which are based on unsharp measurements. Namely, we introduce partial MV-algebras, and we define a corresponding logic. Second, we turn to the representation theory of PBAs. In analogy to the case of orthomodular lattices, we give conditions for a PBA to be isomorphic to the PBA of closed subspaces of a complex Hilbert space. Hereby, we do not restrict ourselves to purely algebraic statements; we rather give preference to conditions involving automorphisms of a PBA. We conclude by outlining a critical view on the logico-algebraic approach to the foundational problem of quantum physics.

Algebraic partial Boolean algebras

Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell–Kochen–Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell–Kochen–Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E8.

Infinite and finite Gleason’s theorems and the logic of indeterminacy

In the first half of the paper I prove Gleason’s lemma: Every non-negative frame function on the set of rays in R3 is continuous. This is the central and most difficult part of Gleason’s theorem. The proof is a reconstruction of Gleason’s idea in terms of orthogonality graphs. The result is a demonstration that this theorem is actually combinatorial in nature. It depends only on a finite graph structure. In the second half of the paper I use the graph construction to obtain results about probability distributions (non-negative frame functions with weight one) on finite sets of rays. For example, given any two distinct nonorthogonal rays a and b, I construct a finite set of rays Γ that contains them, and has the following property: No probability distribution on Γ assigns both a and b a truth value (probability zero or one) unless they are both false. Thus the principle of indeterminacy turns into a theorem of propositional quantum logic (or partial Boolean algebras).

Kochen-Specker theorem in the modal interpretation of quantum mechanics

According to the modal interpretation of quantum mechanics, subsystems of a quantum mechanical system have definite properties, the set of definite properties forming a partial Boolean algebra. It is shown that these partial Boolean algebras have no common extension (as a partial Boolean subalgebra of the properties of the total system) that is embeddable in a Boolean algebra. One has thus either to restrict the rules to preferred subsystems (Healey), or to advocate a shift in metaphysics (Dieks).

Quantum logical solution to the measurement problem of quantum mechanics

In this paper I propose a reformulation and solution of the measurement problem of quantum mechanics. The reformulation depends on a quantum logical interpretation of quantum mechanics, broadly construed. The solution depends on a theorem about partial Boolean algebras which is proved here.

A Representation of Partial Boolean Algebras

We prove that every partial boolean algebra is isomorphic to a partial boolean algebra of sets. As a consequence we obtain finite axiomatization of the theory of partial boolean algebras.

The problem of properties in quantum mechanics

The properties of classical and quantum systems are characterized by different algebraic structures. We know that the properties of a quantum mechanical system form a partial Boolean algebra not embeddable into a Boolean algebra, and so cannot all be co-determinate. We also know that maximal Boolean subalgebras of properties can be (separately) co-determinate. Are there larger subsets of properties that can be co-determinate without contradiction? Following an analysis of Bohrs response to the Einstein-Podolsky-Rosen objection to the complementarity interpretation of quantum mechanics, a principled argument is developed justifying the selection of particular subsets of properties as co-determinate for a quantum system in particular physical contexts. These subsets are generated by sets of maximal Boolean subalgebras, defined in each case by the relation between the quantum state and a measurement (possibly, but not necessarily, the measurement in terms of which we seek to establish whether or not a particular property of the system in question obtains). If we are required to interpret quantum mechanics in this way, then predication for quantum systems is quite unlike the corresponding notion for classical systems.

Connections among quantum logics. Part 1. Quantum propositional logics

In this paper, we propose a theory of quantum logics which is general enough to enable us to reexamine previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which we incorporate are divided into two groups which we call “quantum propositional logics” and “quantum event logics.” We include the work of Kochen and Specker (partial Boolean algebras), Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics. In this part of the paper, we develop an axiom system for quantum propositional logics and examine the above structures in the context of this system.

Quantum Logic, Conditional Probability, and Interference

Friedman and Putnam have argued (Friedman and Putnam 1978) that the quantum logical interpretation of quantum mechanics gives us an explanation of interference that the Copenhagen interpretation cannot supply without invoking an additional ad hoc principle, the projection postulate. I show that it is possible to define a notion of equivalence of experimental arrangements relative to a pure state φ, or (correspondingly) equivalence of Boolean subalgebras in the partial Boolean algebra of projection operators of a system, which plays a role in the Copenhagen explanation of interference analogous to the role played by the material equivalence, given φ, of certain propositions in the Friedman-Putnam quantum logical analysis. I also show that the quantum logical interpretation and the Copenhagen interpretation are equally capable of avoiding the paradoxical conclusion of the Einstein-Podolsky-Rosen argument (Einstein, Podolsky, and Rosen 1935). Thus, neither interference phenomena nor the correlations between separated systems provide a test case for distinguishing between the relative acceptability of the Copenhagen interpretation and the quantum logical interpretation as explanations of quantum effects.

Quantum Logic and the Projection Postulate

This paper explores the status of the von Neumann-Lüders state transition rule (the “projection postulate”) within “real-logic” quantum logic. The entire discussion proceeds from a reading of the Lüders rule according to which, although idealized in applying only to “minimally disturbing” measurements, it nevertheless makes empirical claims and is not a purely mathematical theorem. An argument (due to Friedman and Putnam) is examined to the effect that QL has an explanatory advantage over Copenhagen and other interpretations which relativize truth-value assignments to experimental arrangements. Two versions of QL, the lattice-theoretic (LT) and partial-Boolean-algebra (PBA), are considered. It turns out that the projection postulate is intimately connected with the choice of conditional connective for QL. The effect of the projection postulate is obtained with the Sasaki conditional. However, this choice is found to require extra assumptions, on both the LT and PBA versions, which are either just as ad hoc as the projection postulate itself or indefensible from within the real-logic QL framework.

The impossibility of a bivalent truth-functional semantics for the non-Boolean propositional structures of quantum mechanics

The general fact of the impossibility of a bivalent, truth-functional semantics for the propositional structures determined by quantum mechanics should be more subtly demarcated according to whether the structures are taken to be orthomodular latticesP L or partial-Boolean algebrasP A; according to whether the semantic mappings are required to be truth-functional or truth-functional ; and according to whether two-or-higher dimensional Hilbert spaceP structures or three-or-higher dimensional Hilbert spaceP structures are being considered. If the quantumP structures are taken to be orthomodular latticesP L, then bivalent mappings which preserve the operations and relations of aP L must be truth-functional . Then as suggested by von Neumann and Jauch-Piron and as proven in this paper, the mere presence of incompatible elements in aP L is sufficient to rule out any semantical or hidden-variable proposal which imposes this strong condition, for anytwo-or-higher dimensional Hilbert spaceP L structure. Thus from the orthomodular lattice perspective, the peculiarly non-classical feature of quantum mechanics and the peculiarly non-Boolean feature of the quantum propositional structures is the existence of incompatible magnitudes and propositions. However, the weaker truth-functionality condition can instead be imposed upon the semantic or hidden-variable mappings on theP L structures, although such mappings ignore the lattice meets and joins of incompatibles and preserve only the partial-Boolean algebra structural features of theP L structures. Or alternatively, the quantum propositional structures can be taken to be partial-Boolean algebrasP A, where bivalent mappings which preserve the operations and relations of aP A need only be truth-functional (c). In either case, the Gleason, Kochen-Specker proofs show that any semantical or hidden variable proposal which imposes this truth-functionality (c) condition is impossible for anythree-or-higher dimensional Hilbert spaceP A orP L structures. But such semantical or hidden-variable proposals are possible for any two dimensional Hilbert spaceP A orP L structures, in spite of the presence of incompatibles in these structures, in spite of the fact that Heisenberg's Uncertainty Principle applies to the incompatible elements in these structures, and in spite of the fact that these structures are non-Boolean in the Piron sense.

Partial Boolean algebras in a broader sense and Boolean embeddings

Partial Boolean algebras in a broader sense and Boolean embeddings

Partial Boolean algebras in a broader sense

The article deals with compatible families of Boolean algebras. We define the notion of a partial Boolean algebra in a broader sense (PBA(bs)) and then we show that there is a mutual correspondence between PBA(bs) and compatible families of Boolean algebras (Theorem (1.8)). We examine in detail the interdependence between PBA(bs) and the following classes: partial Boolean algebras in the sense of Kochen and Specker (§ 2), ortholattices (§ 3, § 5), and orthomodular posets (§ 4), respectively.

On extending of partial Boolean algebras to partial *-algebras

On extending of partial Boolean algebras to partial *-algebras