The Probability of the Truth on a Truth Table

Abstract

In symbolic (or mathematical) logic the truth table is used to establish the truth or falsity (falsehood) of both simple and compound statements (or arguments). However, the use of the term “truth table” falsely suggests that all arguments through the table are true. It is known that the table contains both true and false arguments. So the use of “truth table” is indiscriminate. Consequently, this study was focused on solving this problem by finding out the probability of having a true argument associated with every one of the four binary proposition connectives- “and”, “double implication” “inclusive v”, single implication”  used in the arguments. The obtained probabilities are ordered as 1/4, ½ and ¾ respectfully for “and”, “double implication”, and (“inclusive v” and “single implication”). So the “truth tables” are discriminately decomposed into “falsehood tables”, “neutral tables” and “truth tables” at probabilities of ¼, ½ and ¾ respectively. These probabilities are independent of the number of statements, n, greater than unity.