Paraconsistent Foundations for Quantum Probability
Not on the map. Why?
Abstract (arXiv)
It is argued that a fuzzy version of 4-truth-valued paraconsistent logic (with truth values corresponding to True, False, Both and Neither) can be approximately isomorphically mapped into the complex-number algebra of quantum probabilities. I.e., p-bits (paraconsistent bits) can be transformed into close approximations of qubits. The approximation error can be made arbitrarily small, at least in a formal sense, and can be related to the degree of irreducible "evidential error" assumed to plague an observer's observations. This logical correspondence manifests itself in program space via an approximate mapping between probabilistic and quantum types in programming languages.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 16 references that are in the map. First posted on arXiv 19 Jan 2021.
Builds on
2 of 16 references.
References · 2
Built on by
Not cited yet.