Lattices and Their Consistent Quantification
arXiv:1711.07358 · doi:10.1002/andp.201700370
Abstract
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure. Symmetries, such as associativity, constrain consistent quantification and lead to a constraint equation known as the sum rule. Distributivity in distributive lattices also constrains consistent quantification and leads to a product rule. The sum and product rules, which are familiar from, but not unique to, probability theory, arise from the fact that logical statements form a distributive (Boolean) lattice, which exhibits the requisite symmetries.
arXiv comment33 pages, 8 figures
References in corpus (12)
- Quantum Mechanics as Quantum Measure Theory
- Quantum Mechanics as Quantum Information (and only a little more)
- Nonadditive entropy: the concept and its use
- Origin of Complex Quantum Amplitudes and Feynman's Rules
- Quantum Mechanics as Complex Probability Theory
- Foundations of Inference
- Deriving laws from ordering relations
- Quantum information as a non-Kolmogorovian generalization of Shannon's theory
- On the lattice structure of probability spaces in quantum mechanics
- Designing Intelligent Instruments
- Uncovering the Specific Product Rule for the Lattice of Questions
- Logic, Geometry And Probability Theory