Papers
Topics
Authors
Recent
Search
2000 character limit reached

A presentation of Quantum Logic based on an "and then" connective

Published 16 Jan 2007 in cs.LO, quant-ph, and math.LO | (0701113v1)

Abstract: When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Logic as a propositional logic under two connectives: negation and the "and then" operation that combines old and new information. The "and then" connective is neither commutative nor associative. Many properties of this logic are exhibited, and some small elegant subset is shown to imply all the properties considered. No independence or completeness result is claimed. Classical physical systems are exactly characterized by the commutativity, the associativity, or the monotonicity of the "and then" connective. Entailment is defined in this logic and can be proved to be a partial order. In orthomodular lattices, the operation proposed by Finch (1969) satisfies all the properties studied in this paper. All properties satisfied by Finch's operation in modular lattices are valid in Hilbert Space Quantum Logic. It is not known whether all properties of Hilbert Space Quantum Logic are satisfied by Finch's operation in modular lattices. Non-commutative, non-associative algebraic structures generalizing Boolean algebras are defined, ideals are characterized and a homomorphism theorem is proved.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.