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 ponendo 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!
==Overview== MPT is usually described as having the form: #Not both A and B #A #Therefore, not B For example: # Ann and Bill cannot both win the race. # Ann won the race. # Therefore, Bill cannot have won the race. As [[E. J. Lemmon]] describes it: "''Modus ponendo tollens'' is the principle that, if the negation of a conjunction holds and also one of its conjuncts, then the negation of its other conjunct holds."<ref>[[E. J. Lemmon|Lemmon, Edward John]]. 2001. ''Beginning Logic''. [[Taylor and Francis]]/CRC Press, p. 61.</ref> In [[Table of logic symbols|logic notation]] this can be represented as: # <math> \neg (A \land B)</math> # <math> A</math> # <math> \therefore \neg B</math> Based on the [[Sheffer Stroke]] (alternative denial), "|", the inference can also be formalized in this way: # <math> A\,|\,B</math> # <math> A</math> # <math> \therefore \neg B</math>
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)