In the stochastic truth table below, you can change the probabilities assigned to each row. Recall that the sum of the numbers assigned to each row must be 1 and each number must be greater than or equal to 0. The probabilities of the formulas are updated when the stochastic truth table changes. When you hover over a formula with your mouse, the rows of the truth table where that formula is true is highlighted. As you change the probabilities assigned to each row, answer the following questions:
What is the minimum and maximum value of a probability assigned to a formula?
What is the relationship between Pr(¬P∨(P∧Q)) and the sum Pr(¬P)+Pr(P∧Q)?
What is the relationship between Pr(P),Pr(Q) and Pr(P∨Q)?
What is the relationship between Pr(P) and Pr(¬P) (and between Pr(Q) and Pr(¬Q))?
P
Q
T
T
T
F
F
T
F
F
Pr(P)Â =Â 0.5000Pr(Q)Â =Â 0.5000
Pr(¬P) = 0.5000Pr(¬Q) = 0.5000
Pr(P∧Q) = 0.2500
Pr(¬P∨(P∧Q)) = 0.7500
Pr(P∨Q) = 0.7500
Returning to the first two questions asked above:
What is the minimum and maximum value of a probability assigned to a formula? In any stochastic truth table, the probabilities assigned to a formula must be greater than or equal to 0 and less than or equal to 1. This means that in any stochastic truth table, for any formula X, if X is a tautology (so, X is true in every row), then Pr(X)=1.
What is the relationship between Pr(¬P∨(P∧Q)) and the sum Pr(¬P)+Pr(P∧Q)? Note that ¬P and P∧Q are mutually exclusive: There is no row of the truth table that makes both formulas true. That is, ¬P is true in rows 3 and 4, while P∧Q is true in row 1. Since the disjunction of these two formulas ¬P∨(P∧Q) is true in rows 1, 3, and 4, in any stochastic truth table, Pr(¬P∨(P∧Q))=Pr(¬P)+Pr(P∧Q).
These two observations motivate the following three core principles of probability, which are known as the Kolmogorov Axioms (for a further discussion, see Section 1 of Interpretations of Probability, Stanford Encyclopedia of Philosophy by Alan Hajek).
Kolmogorov Axioms
Given any stochastic truth table, the following is true:
For all X, Pr(X)≥0.
For all X, if X is a tautology, then Pr(X)=1.
For all X and Y, if X and Y are mutually exclusive, then Pr(X∨Y)=Pr(X)+Pr(Y).
Since X and ¬X are contradictory and hence mutually exclusive, the Kolmogorov axiom 3 implies that
Pr(X∨¬X)=Pr(X)+Pr(¬X).
Furthermore, since X∨¬X is a tautology, Kolmogorov axiom 3 implies that Pr(X∨¬X)=1. Putting these two equations together, we have 1=Pr(X)+Pr(¬X). This justifies the following:
Complement Law
Given any stochastic truth table, for all formulas X,
Pr(¬X)=1−Pr(X).
Another important property is that equivalent formulas are always assigned the same probability. If X and Y a tautologically equivalent (that is, in every row of the truth table X and Y have the same truth vale), then the probabilities assigned to X must be the same as the probability assigned to Y. For instance, since X is equivalent to (X∧Y)∨(X∧¬Y), they must have the same probability. These two observations are gathered below:
Observation
Given any stochastic truth table, for all formulas X and Y,
if X and Y are tautologically equivalent (i.e., X↔Y is a tautology), then Pr(X)=Pr(Y); and
Pr(X)=Pr((X∧Y)∨(X∧¬Y)).
Using the observations above, we can derive the following further properties of probability.
Observation
Given any stochastic truth table, the following are true:
For all formulas X, if X is a contradiction, then Pr(X)=0.
For all formulas X and Y, Pr(X)=Pr(X∧Y)+Pr(X∧¬Y).
For all formulas X and Y,
if X→Y is a tautology, then Pr(X)≤Pr(Y).
For all formulas X and Y, Pr(X∨Y)=Pr(X)+Pr(Y)−Pr(X∧Y)
As in the example above, in the stochastic truth table below, you can change the probabilities assigned to each row. The conditional probabilities of the formulas are updated when the stochastic truth table changes. As you change the probabilities assigned to each row, answer the following questions:
What is the relationship between Pr(P∧Q), Pr(Q) and Pr(P∣Q)?
Can you find a stochastic truth table such that Pr(P)î€ =Pr(Q)Pr(P∣Q)+Pr(¬Q)Pr(P∣¬Q)?