An example of an argument that fits the form modus ponens:
This argument is valid, but this has no bearing on whether any of the statements in the argument are actually true; for modus ponens to be a sound argument, the premises must be true for any true instances of the conclusion. An argument can be valid but nonetheless unsound if one or more premises are false; if an argument is valid and all the premises are true, then the argument is sound. For example, John might be going to work on Wednesday. In this case, the reasoning for John's going to work (because it is Wednesday) is unsound. The argument is only sound on Tuesdays (when John goes to work), but valid on every day of the week. A propositional argument using modus ponens is said to be deductive.
For example:
Supposing that the premises are both true (the dog will bark if it detects an intruder, and does indeed not bark), it follows that no intruder has been detected. This is a valid argument since it is not possible for the conclusion to be false if the premises are true. (It is conceivable that there may have been an intruder that the dog did not detect, but that does not invalidate the argument; the first premise is “if the dog detects an intruder”. The thing of importance is that the dog detects or does not detect an intruder, not whether there is one.)
Another example:
Another example:
An example in English:
An example, derived from Ernest W. Adams, [3]
Clearly, (3) does not follow from (1) and (2). (1) is true by default, but fails to hold in the exceptional circumstances of Smith dying. In practice, real-world conditionals always tend to involve default assumptions or contexts, and it may be infeasible or even impossible to specify all the exceptional circumstances in which they might fail to be true. For similar reasons, the rule of hypothetical syllogism does not hold for counterfactual conditionals.
An example in English:
An example: we are given the conditional fact that if it is a bear, then it can swim. Then, all 4 possibilities in the truth table are compared to that fact.
If it is a bear, then it can swim — T If it is a bear, then it can not swim — F If it is not a bear, then it can swim — T because it doesn’t contradict our initial fact. If it is not a bear, then it can not swim — T (as above)
Then, to say, “Sam ate an orange for lunch” implies “Sam ate a fruit for lunch” (P –> Q . Logically, if Sam did not eat a fruit for lunch, then Sam also cannot have eaten an orange for lunch (by contraposition). However, merely saying that Sam did not eat an orange for lunch provides no information on whether or not Sam ate a fruit (of any kind) for lunch.
This states that Madison will eat fruits that are apples. It does not, however, exclude the possibility that Madison might also eat bananas or other types of fruit. All that is known for certain is that she will eat any and all apples that she happens upon. That the fruit is an apple is a sufficient condition for Madison to eat the fruit.
This states that the only fruit Madison will eat is an apple. It does not, however, exclude the possibility that Madison will refuse an apple if it is made available, in contrast with (1), which requires Madison to eat any available apple. In this case, that a given fruit is an apple is a necessary condition for Madison to be eating it. It is not a sufficient condition since Madison might not eat all the apples she is given.
This statement makes it clear that Madison will eat all and only those fruits that are apples. She will not leave any apple uneaten, and she will not eat any other type of fruit. That a given fruit is an apple is both a necessary and a sufficient condition for Madison to eat the fruit.
EXPORTATION
Example
If my car is on, when I switch the gear to D the car starts going. If my car is on and I have switched the gear to D, then the car must start going.
For example, if P is the proposition:
Socrates is mortal. then the law of excluded middle holds that the logical disjunction:
Either Socrates is mortal, or it is not the case that Socrates is mortal. is true by virtue of its form alone. That is, the “middle” position, that Socrates is neither mortal nor not-mortal, is excluded by logic, and therefore either the first possibility (Socrates is mortal) or its negation (it is not the case that Socrates is mortal) must be true.
Heraclitus
If a philosophy of Becoming is not possible without change, then (the potential of) what is to become must already exist in the present object. In “We step and do not step into the same rivers; we are and we are not”, both Heraclitus's and Plato's object simultaneously must, in some sense, be both what it now is and have the potential (dynamic) of what it might become.
Protagoras
The most famous saying of Protagoras is: “Man is the measure of all things: of things which are, that they are, and of things which are not, that they are not”.[5] However, Protagoras was referring to things that are used by or in some way related to humans.
BASIC AND DERIVED ARGUMENT FORMS
Name | Mantrakshar | Sequent | Description |
---|---|---|---|
Modus Ponens | If p then q; p; therefore q | ||
Modus Tollens | If p then q; not q; therefore not p | ||
Hypothetical Syllogism | If p then q; if q then r; therefore, if p then r | ||
Disjunctive Syllogism | Either p or q, or both; not p; therefore, q | ||
Constructive Dilemma | If p then q; and if r then s; but p or r; therefore q or s | ||
Destructive Dilemma | If p then q; and if r then s; but not q or not s; therefore not p or not r | ||
Bidirectional Dilemma | If p then q; and if r then s; but p or not s; therefore q or not r | ||
Simplification | p and q are true; therefore p is true | ||
Conjunction | p and q are true separately; therefore they are true conjointly | ||
Addition | p is true; therefore the disjunction (p or q) is true | ||
Composition | If p then q; and if p then r; therefore if p is true then q and r are true | ||
De Morgan's Theorem (1) | The negation of (p and q) is equiv. to (not p or not q) | ||
De Morgan's Theorem (2) | The negation of (p or q) is equiv. to (not p and not q) | ||
Commutation (1) | (p or q) is equiv. to (q or p) | ||
Commutation (2) | (p and q) is equiv. to (q and p) | ||
Commutation (3) | (p is equiv. to q) is equiv. to (q is equiv. to p) | ||
Association (1) | p or (q or r) is equiv. to (p or q) or r | ||
Association (2) | p and (q and r) is equiv. to (p and q) and r | ||
Distribution (1) | p and (q or r) is equiv. to (p and q) or (p and r) | ||
Distribution (2) | p or (q and r) is equiv. to (p or q) and (p or r) | ||
Double Negation | p is equivalent to the negation of not p | ||
Transposition | If p then q is equiv. to if not q then not p | ||
Material Implication | If p then q is equiv. to not p or q | ||
Material Equivalence (1) | (p iff q) is equiv. to (if p is true then q is true) and (if q is true then p is true) | ||
Material Equivalence (2) | (p iff q) is equiv. to either (p and q are true) or (both p and q are false) | ||
Material Equivalence (3) | (p iff q) is equiv to., both (p or not q is true) and (not p or q is true) | ||
Exportation[13] | from (if p and q are true then r is true) we can prove (if q is true then r is true, if p is true) | ||
Importation | If p then (if q then r) is equivalent to if p and q then r | ||
Tautology (1) | p is true is equiv. to p is true or p is true | ||
Tautology (2) | p is true is equiv. to p is true and p is true | ||
Tertium non datur (Law of Excluded Middle) | p or not p is true | ||
Law of Non-Contradiction | p and not p is false, is a true statement |
LOGIC | Mantrakshar | formula / sequent | DESCRIPTION |
---|---|---|---|
Modus Ponens | ; P Therefore Q | ||
Modus Tollens | ; therefore | ||
Hypothetical Syllogism | ; therefore | ||
Disjunctive Syllogism | or therefore Q | ||
Constructive Dilemma | ;AND BUT THEREFORE | ||
Destructive Dilemma | ;AND BUT NOT Q or NOT S THEREFORE NOT P Or NOT R | ||
Bidirectional Dilemma | ;AND BUT P OR THEREFORE Q OR | ||
Simplification | ARE TRUE ; | ||
Conjunction | ARE TRUE SEPARATELY ; | ||
Addition | P IS TRUE | ||
Composition | ;AND ; therefore if p is true then q and r are true | ||
De Morgan's Theorem (1) | and | ||
De Morgan's Theorem (2) | and | ||
Commutation (1) | is equivalent to Q OR P | ||
Commutation (2) | is equivalent to q and p | ||
Commutation (3) | - | ||
Association (1) | P OR is equivalent to OR S | ||
Association (2) | P AND is equivalent to AND R | ||
Distribution (1) | P AND is equivalent to OR (P AND S) | ||
Distribution (2) | P OR is equivalent to AND | ||
Double Negation | P is equivalent to the negation of | ||
Transposition | is equiv to THEN | ||
Material Implication | is equiv to OR Q | ||
Material Equivalence (1) | (p iff q) is equiv. to (if p is true then q is true) and (if q is true then p is true ) | ||
Material Equivalence (2) | (p iff q) is equiv. to either (p and q are true) or (both p and q are false) | ||
Material Equivalence (3) | (p iff q) is equiv to., both (p or not q is true) and (not p or q is true) | ||
Exportation[13] | from (if p and q are true then r is true) we can prove (if q is true then r is true, if p is true) | ||
Importation | |||
Tautology (1) | p is true is equiv. to p is true or p is true | ||
Tautology (2) | p is true is equiv. to p is true and p is true | ||
Tertium non datur (Law of Excluded Middle) | p or not p is true | ||
Law of Non-Contradiction | P and not P |