Disjunctive syllogism

Last updated
Disjunctive syllogism
Type Rule of inference
Field Propositional calculus
StatementIf is true or is true and is false, then is true.
Symbolic statement

In classical logic, disjunctive syllogism [1] [2] (historically known as modus tollendo ponens (MTP), [3] Latin for "mode that affirms by denying") [4] is a valid argument form which is a syllogism having a disjunctive statement for one of its premises. [5] [6]

Contents

An example in English:

  1. I will choose soup or I will choose salad.
  2. I will not choose soup.
  3. Therefore, I will choose salad.

Propositional logic

In propositional logic, disjunctive syllogism (also known as disjunction elimination and or elimination, or abbreviated ∨E), [7] [8] [9] [10] is a valid rule of inference. If it is known that at least one of two statements is true, and that it is not the former that is true; we can infer that it has to be the latter that is true. Equivalently, if P is true or Q is true and P is false, then Q is true. The name "disjunctive syllogism" derives from its being a syllogism, a three-step argument, and the use of a logical disjunction (any "or" statement.) For example, "P or Q" is a disjunction, where P and Q are called the statement's disjuncts. The rule makes it possible to eliminate a disjunction from a logical proof. It is the rule that

where the rule is that whenever instances of "", and "" appear on lines of a proof, "" can be placed on a subsequent line.

Disjunctive syllogism is closely related and similar to hypothetical syllogism, which is another rule of inference involving a syllogism. It is also related to the law of noncontradiction, one of the three traditional laws of thought.

Formal notation

For a logical system that validates it, the disjunctive syllogism may be written in sequent notation as

where is a metalogical symbol meaning that is a syntactic consequence of , and .

It may be expressed as a truth-functional tautology or theorem in the object language of propositional logic as

where , and are propositions expressed in some formal system.

Natural language examples

Here is an example:

  1. It is red or it is blue.
  2. It is not blue.
  3. Therefore, it is red.

Here is another example:

  1. The breach is a safety violation, or it is not subject to fines.
  2. The breach is not a safety violation.
  3. Therefore, it is not subject to fines.

Inclusive and exclusive disjunction

It may be observed that the disjunctive syllogism works whether 'or' is considered 'exclusive' or 'inclusive' disjunction. See below for the definitions of these terms.

There are two kinds of logical disjunction:

The concept of "or" as it exists in the English language is often ambiguous between these two meanings, but the difference is pivotal in evaluating disjunctive arguments.

The argument

  1. P or Q.
  2. Not P.
  3. Therefore, Q.

is valid and indifferent between both meanings. However, only in the exclusive meaning is the following form valid:

  1. Either (only) P or (only) Q.
  2. P.
  3. Therefore, not Q.

With the inclusive meaning, one could draw no conclusion from the first two premises of that argument. See affirming a disjunct.

Unlike modus ponens and modus ponendo tollens , with which it should not be confused, disjunctive syllogism is often not made an explicit rule or axiom of logical systems, as the above arguments can be proven with a combination of reductio ad absurdum and disjunction elimination.

Other forms of syllogism include:

Disjunctive syllogism holds in classical propositional logic and intuitionistic logic, but not in some paraconsistent logics. [11]

See also

Related Research Articles

<span class="mw-page-title-main">Logical disjunction</span> Logical connective OR

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction, is a logical connective typically notated as and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula , assuming that abbreviates "it is sunny" and abbreviates "it is warm".

Disjunction introduction or addition is a rule of inference of propositional logic and almost every other deduction system. The rule makes it possible to introduce disjunctions to logical proofs. It is the inference that if P is true, then P or Q must be true.

In propositional logic, disjunction elimination is the valid argument form and rule of inference that allows one to eliminate a disjunctive statement from a logical proof. It is the inference that if a statement implies a statement and a statement also implies , then if either or is true, then has to be true. The reasoning is simple: since at least one of the statements P and R is true, and since either of them would be sufficient to entail Q, Q is certainly true.

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

In propositional logic, modus ponens, also known as modus ponendo ponens, implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "P implies Q.P is true. Therefore, Q must also be true."

In propositional logic, modus tollens (MT), also known as modus tollendo tollens and denying the consequent, is a deductive argument form and a rule of inference. Modus tollens is a mixed hypothetical syllogism that takes the form of "If P, then Q. Not Q. Therefore, not P." It is an application of the general truth that if a statement is true, then so is its contrapositive. The form shows that inference from P implies Q to the negation of Q implies the negation of P is a valid argument.

<span class="mw-page-title-main">De Morgan's laws</span> Pair of logical equivalences

In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.

Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not assume the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

In classical logic, a hypothetical syllogism is a valid argument form, a deductive syllogism with a conditional statement for one or both of its premises. Ancient references point to the works of Theophrastus and Eudemus for the first investigation of this kind of syllogisms.

In mathematical logic, sequent calculus is a style of formal logical argumentation in which every line of a proof is a conditional tautology instead of an unconditional tautology. Each conditional tautology is inferred from other conditional tautologies on earlier lines in a formal argument according to rules and procedures of inference, giving a better approximation to the natural style of deduction used by mathematicians than to David Hilbert's earlier style of formal logic, in which every line was an unconditional tautology. More subtle distinctions may exist; for example, propositions may implicitly depend upon non-logical axioms. In that case, sequents signify conditional theorems in a first-order language rather than conditional tautologies.

In propositional logic, double negation is the theorem that states that "If a statement is true, then it is not the case that the statement is not true." This is expressed by saying that a proposition A is logically equivalent to not (not-A), or by the formula A ≡ ~(~A) where the sign ≡ expresses logical equivalence and the sign ~ expresses negation.

A paraconsistent logic is an attempt at a logical system to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing "inconsistency-tolerant" systems of logic which reject the principle of explosion.

In classical logic, intuitionistic logic and similar logical systems, the principle of explosion, or the principle of Pseudo-Scotus, is the law according to which any statement can be proven from a contradiction. That is, from a contradiction, any proposition can be inferred; this is known as deductive explosion.

Constructive dilemma is a valid rule of inference of propositional logic. It is the inference that, if P implies Q and R implies S and either P or R is true, then either Q or S has to be true. In sum, if two conditionals are true and at least one of their antecedents is, then at least one of their consequents must be too. Constructive dilemma is the disjunctive version of modus ponens, whereas, destructive dilemma is the disjunctive version of modus tollens. The constructive dilemma rule can be stated:

Destructive dilemma is the name of a valid rule of inference of propositional logic. It is the inference that, if P implies Q and R implies S and either Q is false or S is false, then either P or R must be false. In sum, if two conditionals are true, but one of their consequents is false, then one of their antecedents has to be false. Destructive dilemma is the disjunctive version of modus tollens. The disjunctive version of modus ponens is the constructive dilemma. The destructive dilemma rule can be stated:

In propositional logic, transposition is a valid rule of replacement that permits one to switch the antecedent with the consequent of a conditional statement in a logical proof if they are also both negated. It is the inference from the truth of "A implies B" to the truth of "Not-B implies not-A", and conversely. It is very closely related to the rule of inference modus tollens. It is the rule that

In logic, especially mathematical logic, a Hilbert system, sometimes called Hilbert calculus, Hilbert-style deductive system or Hilbert–Ackermann system, is a type of system of formal deduction attributed to Gottlob Frege and David Hilbert. These deductive systems are most often studied for first-order logic, but are of interest for other logics as well.

Minimal logic, or minimal calculus, is a symbolic logic system originally developed by Ingebrigt Johansson. It is an intuitionistic and paraconsistent logic, that rejects both the law of the excluded middle as well as the principle of explosion, and therefore holding neither of the following two derivations as valid:

In propositional logic, tautology is either of two commonly used rules of replacement. The rules are used to eliminate redundancy in disjunctions and conjunctions when they occur in logical proofs. They are:

References

  1. Copi, Irving M.; Cohen, Carl (2005). Introduction to Logic. Prentice Hall. p. 362.
  2. Hurley, Patrick (1991). A Concise Introduction to Logic 4th edition . Wadsworth Publishing. pp. 320–1. ISBN   9780534145156.
  3. Lemmon, Edward John. 2001. Beginning Logic. Taylor and Francis/CRC Press, p. 61.
  4. Stone, Jon R. (1996). Latin for the Illiterati: Exorcizing the Ghosts of a Dead Language . London: Routledge. p.  60. ISBN   0-415-91775-1.
  5. Hurley
  6. Copi and Cohen
  7. Sanford, David Hawley. 2003. If P, Then Q: Conditionals and the Foundations of Reasoning. London, UK: Routledge: 39
  8. Hurley
  9. Copi and Cohen
  10. Moore and Parker
  11. Chris Mortensen, Inconsistent Mathematics, Stanford encyclopedia of philosophy, First published Tue Jul 2, 1996; substantive revision Thu Jul 31, 2008