Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Modus tollens
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Correspondence to other mathematical frameworks== ===Probability calculus=== ''Modus tollens'' represents an instance of the [[law of total probability]] combined with [[Bayes' theorem]] expressed as: <math display="block">\Pr(P)=\Pr(P\mid Q)\Pr(Q)+\Pr(P\mid \lnot Q)\Pr(\lnot Q)\,,</math> where the conditionals <math>\Pr(P\mid Q)</math> and <math>\Pr(P\mid \lnot Q)</math> are obtained with (the extended form of) [[Bayes' theorem]] expressed as: <math display="block">\Pr(P\mid Q) = \frac{\Pr(Q \mid P)\,a(P)}{\Pr(Q\mid P)\,a(P)+\Pr(Q\mid \lnot P)\,a(\lnot P)}\;\;\;</math> and <math display="block">\Pr(P\mid \lnot Q) = \frac{\Pr(\lnot Q \mid P)\,a(P)}{\Pr(\lnot Q\mid P)\,a(P)+\Pr(\lnot Q\mid \lnot P)\,a(\lnot P)}.</math> In the equations above <math>\Pr(Q)</math> denotes the probability of <math>Q</math>, and <math>a(P)</math> denotes the [[base rate]] (aka. [[prior probability]]) of <math>P</math>. The [[conditional probability]] <math>\Pr(Q\mid P)</math> generalizes the logical statement <math>P \to Q</math>, i.e. in addition to assigning TRUE or FALSE we can also assign any probability to the statement. Assume that <math>\Pr(Q) = 1</math> is equivalent to <math>Q</math> being TRUE, and that <math>\Pr(Q) = 0</math> is equivalent to <math>Q</math> being FALSE. It is then easy to see that <math>\Pr(P) = 0</math> when <math>\Pr(Q\mid P) = 1</math> and <math>\Pr(Q) = 0</math>. This is because <math>\Pr(\lnot Q\mid P) = 1 - \Pr(Q\mid P) = 0</math> so that <math>\Pr(P\mid \lnot Q) = 0</math> in the last equation. Therefore, the product terms in the first equation always have a zero factor so that <math>\Pr(P) = 0</math> which is equivalent to <math>P</math> being FALSE. Hence, the [[law of total probability]] combined with [[Bayes' theorem]] represents a generalization of ''modus tollens''.<ref>Audun Jøsang 2016:p.2</ref> ===Subjective logic=== ''Modus tollens'' represents an instance of the abduction operator in [[subjective logic]] expressed as: <math display="block">\omega^{A}_{P\tilde{\|}Q}= (\omega^{A}_{Q|P},\omega^{A}_{Q|\lnot P})\widetilde{\circledcirc} (a_{P},\,\omega^{A}_{Q})\,,</math> where <math>\omega^{A}_{Q}</math> denotes the subjective opinion about <math>Q</math>, and <math>(\omega^{A}_{Q|P},\omega^{A}_{Q|\lnot P})</math> denotes a pair of binomial conditional opinions, as expressed by source <math>A</math>. The parameter <math>a_{P}</math> denotes the [[base rate]] (aka. the [[prior probability]]) of <math>P</math>. The abduced marginal opinion on <math>P</math> is denoted <math>\omega^{A}_{P\tilde{\|}Q}</math>. The conditional opinion <math>\omega^{A}_{Q|P}</math> generalizes the logical statement <math>P \to Q</math>, i.e. in addition to assigning TRUE or FALSE the source <math>A</math> can assign any subjective opinion to the statement. The case where <math>\omega^{A}_{Q}</math> is an absolute TRUE opinion is equivalent to source <math>A</math> saying that <math>Q</math> is TRUE, and the case where <math>\omega^{A}_{Q}</math> is an absolute FALSE opinion is equivalent to source <math>A</math> saying that <math>Q</math> is FALSE. The abduction operator <math>\widetilde{\circledcirc}</math> of [[subjective logic]] produces an absolute FALSE abduced opinion <math>\omega^{A}_{P\widetilde{\|}Q}</math> when the conditional opinion <math>\omega^{A}_{Q|P}</math> is absolute TRUE and the consequent opinion <math>\omega^{A}_{Q}</math> is absolute FALSE. Hence, subjective logic abduction represents a generalization of both ''modus tollens'' and of the [[Law of total probability]] combined with [[Bayes' theorem]].<ref>Audun Jøsang 2016:p.92</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)