Projection-algebras and quantum logic (2402.07042v2)
Abstract: P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is binary. Elements of X are called features. A partial order is defined on the set X of features by x <= y iff x.y = x. Features commute, i.e., x.y = y.x iff x.y <= x. Features x and y are said to be orthogonal iff x.y = 0 and orthogonality is a symmetric relation.The operation + is defined as the dual of . and it is commutative on orthogonal features. The closed subspaces of a separable Hilbert space form a P-algebra under orthogonal complementation and projection of a subspace onto another one.P-algebras are complemented orthomodular posets but they are not lattices. Existence of least upper bounds for ascending sequences is equivalent to the existence of least upper bounds for countable sets of pairwise orthogonal elements. Atomic algebras are defined and their main properties are studied. The logic of P-algebras is then completely characterized. The language contains a unary connective corresponding to the operation ' and a binary connective corresponding to the operation ".". It is a substructural logic of sequents where the Exchange rule is extremely limited. It is proved to be sound and complete for P-algebras.
- Garrett Birkhoff and John von Neumann. The logic of quantum mechanics. Annals of Mathematics, 37:823–843, 1936.
- W. Buszkowski. Involutive nonassociative lambek calculus: Sequent systems and complexity. Bulletin of the Section of Logic, 46:75–91, 2017.
- Uniquely complemented posets. Order, 35:421–431, 2018.
- Nonassociative substructural logics and their semilinear extensions: Axiomatization and completeness properties. The Review of Symbolic Logic, 6:394–423, 2013.
- A substructural gentzen calculus for orthomodular quantum logic. The Review of Symbolic Logic, January 2022. DOI: https://doi.org/10.1017/S1755020322000016.
- P. D. Finch. On the lattice structure of quantum logic. Bulletin of the Australian Mathematical Society, 1:333–340, 1969.
- N. Galatos and H. Ono. Cut elimination and strong separation for substructural logics: An algebraic approach. Annals of Pure and Applied Logic, 161:1097–1133, 2009.
- Gerhard Gentzen. Über die existenz unabhängiger axiomensysteme zu unendlichen satzsystemen. Mathematische Annalen, 107:329–350, 1932.
- Gerhard Gentzen. The Collected Papers of Gerhard Gentzen, edited by M. E. Szabo. North Holland, Amsterdam, 1969.
- Saunders Mac Lane. A lattice formulation for transcendence degree and p-bases. Duke Mathematical Journal, 4(3,38-00438-7):455–468, September 1938.
- Daniel Lehmann. Connectives in cumulative logics. In Pillars of Computer Science, Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday, number 4800 in Lecture Notes in Computer Science, pages 424–440. Springer Verlag, 2008.
- Daniel Lehmann. A presentation of quantum logic based on an ”and then” connective. Journal of Logic and Computation, 18(1):59–76, February 2008. doi: 10.1093/logcom/exm054.
- R. Moot and C. Retoré. The non-associative lambek calculus. In The Logic of Categorial Grammars, pages 101–147. Springer, Berlin, 2012.
- Hilary Putnam. How to think quantum logically. Synthese, 29:55–61, 1974.
- Ernst Steinitz. Algebraische Theorie der Körper. 1930.
- On uniquely complemented posets. Order, 22:11–20, 2005.