In 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set theory, and showed that appropriate counterparts of the axioms of Zermelo–Fraenkel set theory with the axiom of choice hold in the model. In this paper, we aim at unifying Takeuti’s model with Boolean-valued models by constructing models based on general complete orthomodular (...) lattices, and generalizing the transfer principle in Boolean-valued models, which asserts that every theorem in ZFC set theory holds in the models, to a general form holding in every orthomodular-valued model. One of the central problems in this program is the well-known arbitrariness in choosing a binary operation for implication. To clarify what properties are required to obtain the generalized transfer principle, we introduce a class of binary operations extending the implication on Boolean logic, called generalized implications, including even nonpolynomially definable operations. We study the properties of those operations in detail and show that all of them admit the generalized transfer principle. Moreover, we determine all the polynomially definable operations for which the generalized transfer principle holds. This result allows us to abandon the Sasaki arrow originally assumed for Takeuti’s model and leads to a much more flexible approach to quantum set theory. (shrink)

In this paper we investigate the relation between the axiomatization of a given logical consequence operation and axiom systems defining the class of algebras related to that consequence operation. We show examples which prove that, in general there are no natural relation between both ways of axiomatization.

We prove that no logic (i.e. consequence operation) determined by any class of orthomodular lattices admits the deduction theorem (Theorem 2.7). We extend those results to some broader class of logics determined by ortholattices (Corollary 2.6).

Logical matrices for orthomodular logic are introduced. The underlying algebraic structures are orthomodular lattices, where the conditional connective is the Sasaki arrow. An axiomatic calculusOMC is proposed for the orthomodular-valid formulas.OMC is based on two primitive connectives — the conditional, and the falsity constant. Of the five axiom schemata and two rules, only one pertains to the falsity constant. Soundness is routine. Completeness is demonstrated using standard algebraic techniques. The Lindenbaum-Tarski algebra ofOMC is constructed, and it is shown to be (...) an orthomodular lattice whose unit element is the equivalence class of theses ofOMC. (shrink)

We show that using quasi-set theory, or the theory of collections of indistinguishable objects, we can define an algebra that has most of the standard properties of an orthocomplete orthomodular lattice, which is the lattice of all closed subspaces of a Hilbert space. We call the mathematical structure so obtained $\mathfrak{I}$-lattice. After discussing some aspects of such a structure, we indicate the next problem of axiomatizing the corresponding logic, that is, a logic which has $\mathfrak{I}$-lattices as its Lindembaum algebra, which (...) we postpone to a future work. Thus we conclude that the initial intuitions by Birkhoff and von Neumann that the ``logic of quantum mechanics" would be not classical logic, is consonant with the idea of considering indistinguishability right from the start, that is, as a primitive concept. In the first sections, we present the main motivations and a ``classical'' situation which mirrors that one we focus on the last part of the paper. This paper is our first analysis of the algebraic structure of indiscernibility. (shrink)

In quantum logic, introduced by Birkhoff and von Neumann, De Morgan's Laws play an important role in the projection-valued truth value assignment of observational propositions in quantum mechanics. Takeuti's quantum set theory extends this assignment to all the set-theoretical statements on the universe of quantum sets. However, Takeuti's quantum set theory has a problem in that De Morgan's Laws do not hold between universal and existential bounded quantifiers. Here, we solve this problem by introducing a new truth value assignment for (...) bounded quantifiers that satisfies De Morgan's Laws. To justify the new assignment, we prove the Transfer Principle, showing that this assignment of a truth value to every bounded ZFC theorem has a lower bound determined by the commutator, a projection-valued degree of commutativity, of constants in the formula. We study the most general class of truth value assignments and obtain necessary and sufficient conditions for them to satisfy the Transfer Principle, to satisfy De Morgan's Laws, and to satisfy both. For the class of assignments with polynomially definable logical operations, we determine exactly 36 assignments that satisfy the Transfer Principle and exactly 6 assignments that satisfy both the Transfer Principle and De Morgan's Laws. (shrink)