Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Soft Computing

Representation of conditional probability on a quantum logic

Oľga Nánásiová

Published Apr 1, 2000• 3 citations
Publisher
DOI
10.1007/s005000050079

Related papers

Conditional probability on a quantum logic

Oľga Nánásiová

International Journal of Theoretical Physics•Nov 1, 1986•6 citations

Representations of Quantum Logics and Transition Probability Spaces

Sylvia Pulmannová

Springer eBooks•Jan 1, 1989•3 citations

Quantum Logic, Conditional Probability, and Interference

Michaël Friedman

dialectica•Jan 1, 1978•54 citations

Representation theorem for obsevables on a quantum logic

Andrei Yu. Khrennikov, Oľga Nánásiová

We study a conditional state on a quantum logic using Renyi's approach (or Bayesian principle). This approach helps us to define independence of events and differently from the situation in the classical theory of probability, if an event $a$ is independent of an event $b$, then the event $b$ can be dependent on the event $a$. We will show that we can define a $s$-map (function for simultaneous measurements on a quantum logic). It can be shown that if we have the conditional state we can define the $s$-map and conversely. By using the $s$-map we can introduce joint distribution also for noncompatible observables on a quantum logic.

arXiv:quant-ph/0302053•Feb 7, 2003•0 citations

A Logic for Probability in Quantum Systems

Ron van der Meyden, Manas K. Patra

Lecture notes in computer science•Jan 1, 2003•20 citations

Using ordered pairs to transcend the lilitations of knowledge representation with application to quantum logic.

Phil Catabrese

The algebraic construct of 'forming ordered pairs of the members of a set' has been used and reused with amazing success. Among these developments are Integer Fractions to better measure distances with pairs of whole numbers; Dedekind Cuts - an early way to define real numbers with ordered pairs of subsets of fractions; Vectors; Quatemians; and others like complex numbers - ordered pairs of real numbers. In the realm of Boolean Logic, ordered pairs of Boolean propositions (alternately ordered pairs of subsets of some universe set) transcend the limitations of pure Boolean Iogic to represent partially true conditional statements such as those used by conditiona1 probability. Pure Boolean logic is unable to adequately represent uncertain conditional logic, but ordered pairs of BooIean propositions can and do represent this knowledge in the logic of Boolean Fractions, also called Conditional Events. A given B can not be represented by A or not B unless P(AJB) and P(B) are both 1. Otherwise, P(A1B) < P(A or not B). But A given B can be represented by an ordered pair of propositions (AJB). These Boolean Fractions apply to the natural language and logic of A given B, they apply to classical conditional probability calculations, to expert system if-then rules, and now to the logic of quantum measurements, a logic that Boolean algebra could not represent, but which Boolean Fractions can represent without Hilbert space.

IEEE International Conference on Information Reuse and Integration (IRI)•Jan 1, 2004•0 citations
We study a conditional state on a quantum logic using Renyi's approach (or Bayesian principle). This approach helps us to define independence of events and differently from the situation in the classical theory of probability, if an event aaa is independent of an event bbb, then the event bbb can be dependent on the event aaa. We will show that we can define a sss-map (function for simultaneous measurements on a quantum logic). It can be shown that if we have the conditional state we can define the sss-map and conversely. By using the sss-map we can introduce joint distribution also for noncompatible observables on a quantum logic.
The algebraic construct of 'forming ordered pairs of the members of a set' has been used and reused with amazing success. Among these developments are Integer Fractions to better measure distances with pairs of whole numbers; Dedekind Cuts - an early way to define real numbers with ordered pairs of subsets of fractions; Vectors; Quatemians; and others like complex numbers - ordered pairs of real numbers. In the realm of Boolean Logic, ordered pairs of Boolean propositions (alternately ordered pairs of subsets of some universe set) transcend the limitations of pure Boolean Iogic to represent partially true conditional statements such as those used by conditiona1 probability. Pure Boolean logic is unable to adequately represent uncertain conditional logic, but ordered pairs of BooIean propositions can and do represent this knowledge in the logic of Boolean Fractions, also called Conditional Events. A given B can not be represented by A or not B unless P(AJB) and P(B) are both 1. Otherwise, P(A1B) < P(A or not B). But A given B can be represented by an ordered pair of propositions (AJB). These Boolean Fractions apply to the natural language and logic of A given B, they apply to classical conditional probability calculations, to expert system if-then rules, and now to the logic of quantum measurements, a logic that Boolean algebra could not represent, but which Boolean Fractions can represent without Hilbert space.