I wonder if anyone has explored a quantitative measurement of the soundness of an argument. By soundness, I mean the extent to which the argument's premises are true and valid. By quantitative measure, I mean has anyone constructed a number that, if you glanced at it, gave you a sense of how sound an argument is?
An argument is either logically valid or is not logically valid. There is no middle ground here. In terms of numbers, the logical validity of an argument can be either of the two values in the Boolean domain, which are
A premise is either true or is not true. In terms of numbers, the truth of a premise can be either of the two values in the Boolean domain, which are
Intuitively, the truth of a set of truth-bearers is a ratio of the subset of true truth-bearers to the superset. Basically, what I'm saying is that If half of an argument's premises are true then the set of that argument's premises is half true.
0is false and
1is true, then "half-true" seems like it would be
- If both are true, then the the value is
- If neither are true, then the value is
If we know that an argument has any invalid deductions, then we know that the argument is not sound.
- If we know that an argument has any false premise, then we know that the argument is not sound.
- So, for the soundness of an argument to be represented by a number that is not in the Boolean domain, then that argument would need to be missing some information. Arguments are made valid by reasoning with valid deductive steps and premises are made true by qualities of their extension in the real world. Since knowledge of valid deduction is necessary for interpretation, we can make determine that if there is missing information it is probably about the truth of the premises. This is not absolutely necessary, but we can pretend it is for this discussion because cases where we can't determine how to think logically are significantly less common than cases where we don't can't determine if a statement is true or not.
So, any "quantification of soundness" is going to require that we don't know the truth value of at least one of the premises. Now let's revisit your question: "Are there quantitative measures for the soundness of an argument?" Since we can determine this depends on the truth of the premises with unknown truth values, we can rephrase the question as "Are there any quantitative measures for the truth of premises with unknown truth values?"
When phrased this way it becomes clear that what you're actually asking for is Probability, defined on Wikipedia as "the measure or estimation of how likely it is that something will happen or that a statement is true". Probabilities are also ranged over the Boolean domain, but include real numbers and not just integers. So,
0 means that the statement will never be true and
1 means that the statement will always be true. Mapping probabilities to logical/set operations is pretty intuitive. Intersection of premises multiplies the probabilities of their truths to get the probability of truth of the composite judgment. So, if there is a 0.5 probability that P is true and 0.4 probability that Q is true then there is a 0.2 probability that both P and Q will be true. This type of math works equivalently for greater numbers of premises. That should be enough for you to get started.
The point is that the quantitative measure of the soundness of an argument can be reduced to the probability that all its premises are true.
If you like reductionism and you have an Occam prior, the answer is yes.
Given any phenomenon, the simplest explanation is best. But 'Simple' is a word in English, so what does that actually mean? Preferably in numbers, so you can compare which is simpler with a single complexity(argumentX)>complexity(argumentY) therefore Y?
Occam's Razor is often phrased as "The simplest explanation that fits the facts." Robert Heinlein replied that the simplest explanation is "The lady down the street is a witch; she did it."
There are two expansions on that which are isomorph to each other: Solomonoff Induction and Minimum Message Length.
Minimum Message Length:
The lady down the street is a witch, she did it. She did what, exactly? The shortest message (measured in bits of information) you can use to describe what happened is the Minimum Message Length. Shortest message wins. (Example: Explaining the theory of gravity and the starting state of a system is shorter than describing each position the system takes over time. Since the message is shorter with the Theory of Gravity, the Theory of Gravity is a simpler explanation that "it just happened like this."
The lady down the street is a witch, she did it. She is a what, exactly? Well she is [The simplest turing machine you can write that describes how she acts], and she did it.
It turns out that with some fancy math, it can be shown that explanation that takes the simplest turing machine to develop is also the explanation that has the shortest message length, so either works.
That is a QUALITATIVE measure of which argument is SIMPLER, which (in reductionism with an Occam prior) is also the argument that is sounder.