Skip to main content
Engineering LibreTexts

2.5A: Arguments

  • Page ID
    9910
  • Let stand for the proposition “Today is Tuesday”, and let stand for the proposition “This is Belgium”. Then the above argument has the form

    pq

    \(\frac{p}{\therefore q}\)

    Now, for any propositions and q—not just the ones in this particular argument—if→ is true and is true, then must also be true. This is easy to check in a truth table:

    屏幕快照 2019-06-28 16.48.23.png

    The only case where both → and are true is on the last line of the table, and in this case, is also true. If you believe → and p, you have no logical choice but to believe q. This applies no matter what and represent. For example, if you believe “If Jill is breathing, then Jill pays taxes”, and you believe that “Jill is breathing”, logic forces you to believe that “Jill pays taxes”. Note that we can’t say for sure that the conclusion is true, only that if the premises are true, then the conclusion must be true.

    This fact can be rephrased by saying that ((→ q) ∧ p) → is a tautology. More generally, for any compound propositions P and Q, saying “P → Q is a tautology” is the same as saying that “in all cases where P is true, Q is also true”.14 We will use the notation P =⇒ Q to mean that P → Q is a tautology. Think of P as being the premise of an argument or the conjunction of several premises. To say P =⇒ Q is to say that Q follows logically from P. We will use the same notation in both propositional logic and predicate logic. (Note that the relation of =⇒ to → is the same as the relation of ≡ to↔.)

    Definition 2.10.

    Let P and Q be any formulas in either propositional logic or predicate logic. The notation P =⇒ Q is used to mean that P → Q is a tautology. That is, in all cases where P is true, Q is also true. We then say that Q can be logically deduced from P or that P logically implies Q.

    An argument in which the conclusion follows logically from the premises is said to be a valid argument. To test whether an argument is valid, you have to replace the particular propositions or predicates that it contains with variables, and then test whether the conjunction of the premises logically implies the conclusion. We have seen that any argument of the form

    pq

    \(\frac{p}{\therefore q}\)

    is valid, since ((→ q) ∧ p) → is a tautology. This rule of deduction is called modus ponens. It plays a central role in logic. Another, closely related rule is modus tollens, which applies to arguments of the form

    pq

    \(\frac{\neg q}{\therefore \neg p}\)

    To verify that this is a valid argument, just check that ((→ q) ∧ ¬q) =⇒ ¬p, that is, that ((→ q) ∧ ¬q) → ¬is a tautology. As an example, the following argument has the form of modus tollens and is therefore a valid argument:

    If Feyenoord is a great team, then I’m the king of the Netherlands

    I am not the king of the Netherlands
    ∴ Feyenoord is not a great team

    You might remember this argument from page 10. You should note carefully that the validity of this argument has nothing to do with whether or not Feyenoord can play football well. The argument forces you to accept the conclusion only if you accept the premises. You can logically believe that the conclusion is false, as long as you believe that at least one of the premises is false.

    Another named rule of deduction is the Law of Syllogism, which has the form

    pq

    \(\frac{q \rightarrow r}{\therefore p \rightarrow r}\)

    For example:

    f you study hard, you do well in school
    If you do well in school, you get a good job

    ∴ If you study hard, you get a good job

    There are many other rules. Here are a few that might prove useful. Some of them might look trivial, but don’t underestimate the power of a simple rule when it is combined with other rules.

    pq    p    pq    p
    ¬p     q     p     pq

    q     pq

    Logical deduction is related to logical equivalence. We defined P and Q to be logically equivalent if P ↔ Q is a tautology. Since P ↔ Q is equivalent to (P → Q) ∧ (Q → P), we see that P ≡ Q if and only if both Q =⇒ P and P =⇒ Q. Thus, we can show that two statements are logically equivalent if we can show that each of them can be logically deduced from the other. Also, we get a lot of rules about logical deduction for free—two rules of deduction for each logical equivalence we know. For example, since ¬(∧ q) ≡(¬∨ ¬q), we get that ¬(∧ q) =⇒ (¬∨ ¬q). For example, if we know “It is not both sunny and warm”, then we can logically deduce “Either it’s not sunny or it’s not warm.” (And vice versa.)