Published on Tue Jan 19 2021

Paraconsistent Foundations for Quantum Probability

Ben Goertzel

A fuzzy version of 4-truth-valued paraconsistent logic can be isomorphically mapped into the complex-number algebra of quantum probabilities. I.e., p-bits (paraconsistent bits) can be transformed into close approximations of qubits.

0
0
0
Abstract

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.

Wed Jan 16 2013
Artificial Intelligence
A Complete Calculus for Possibilistic Logic Programming with Fuzzy Propositional Variables
In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and representing vague knowledge.Formulas are represented by pairs (A, c), where A is a many-valued proposition and c is value in the unit interval [0,1]
0
0
0
Wed Mar 27 2013
Artificial Intelligence
Generalizing Fuzzy Logic Probabilistic Inferences
Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are necessary to compute probabilities of events with relations between the. propositions specified with propositional calculus.
0
0
0
Fri Feb 15 2002
Artificial Intelligence
Nonmonotonic Logics and Semantics
0
0
0
Wed Mar 20 2013
Artificial Intelligence
A Logic of Graded Possibility and Certainty Coping with Partial Inconsistency
Proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Each fuzzy set representing a possibility distribution describing the state of the world.
0
0
0
Tue Jan 31 2017
Artificial Intelligence
On the Semantics and Complexity of Probabilistic Logic Programs
We examine the meaning and the complexity of probabilistic logic programs. We focus on two semantics based on stable and on well-founded models. We show that the semantics based on stable models produces sets of probability models that dominate infinitely.
0
0
0
Wed Feb 13 2013
Artificial Intelligence
Entailment in Probability of Thresholded Generalizations
A nonmonotonic logic of thresholded generalizations is presented. It is shown that entailment in probability is closely related to Goldszmidt andPearl's System-Z^+.
0
0
0