Rules of Inference: Getting Familiar with Basic Rules and More Rules, Schemes and Mind Maps of Law

Answers to exercises on the rules of inference, including basic rules such as modus ponens, simplification, and conjunction, as well as more complex rules such as hypothetical syllogism and disjunctive syllogism. It also covers DeMorgan's Law, double negation, transposition, distribution, and proof methods.

Typology: Schemes and Mind Maps

2021/2022

Uploaded on 08/01/2022

hal_s95
hal_s95 🇵🇭

4.4

(655)

10K documents

1 / 11

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Chapter 6 Rules of deductive inference
Answers to select “Getting familiar with…” exercises.
Getting familiar with… basic rules of inference.
1.
1. A
2. (A B) /.: B
3. B 1, 2 modus ponens
3.
1. (P & Q)
2. (R & S) /.: P
3. P 1 simplification
5.
1. ((R v S) & Q)
2. (~Q v S)
3. T /.: (Q & T)
4. Q 1 simplification
5. (Q & T) 3, 4 conjunction
7.
1. ((A B) (C v D))
2. ~ (C D) /.: ~(A B)
3. ~(A B) 1, 2 modus tollens
9.
1. ((P Q) & (S R))
2. (~ Q & ~ R) /.: (~P & ~S)
3. (P Q) 1 simplification
4. ~ Q 2 simplification
5. ~P 3, 4 modus tollens
6. (S R) 1 simplification
7. ~R 2 simplification
8. ~S 5,6 modus tollens
9. (~P & ~S) 5, 8 conjunction
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Rules of Inference: Getting Familiar with Basic Rules and More Rules and more Schemes and Mind Maps Law in PDF only on Docsity!

Chapter 6 Rules of deductive inference Answers to select “Getting familiar with…” exercises.

Getting familiar with… basic rules of inference.

  1. A

  2. (A ⊃ B) /.: B

  3. B 1, 2 modus ponens

1. (P & Q)

2. (R & S) /.: P

  1. P 1 simplification
  1. ((R v S) & Q)

  2. (~Q v S)

  3. T /.: (Q & T)

  4. Q 1 simplification

  5. (Q & T) 3, 4 conjunction

  6. ((A ⊃ B) ⊃ (C v D))

  7. ~ (C ⊃ D) /.: ~(A ⊃ B)

  8. ~(A ⊃ B) 1, 2 modus tollens

1. ((P ⊃ Q) & (S ⊃ R))

2. (~ Q & ~ R) /.: (~P & ~S)

  1. (P ⊃ Q) 1 simplification
  2. ~ Q 2 simplification
  3. ~P 3, 4 modus tollens
  4. (S ⊃ R) 1 simplification
  5. ~R 2 simplification
  6. ~S 5,6 modus tollens
  7. (~P & ~S) 5, 8 conjunction

1. ((P &Q) & W)

2. R /.: W

  1. W 1 simplification

1. A

  1. (B v C)
  2. ((A & (B v C)) ⊃ D) /.: D
  3. (A & (B v C)) 1, 3 conjunction
  4. D 3, 4 modus ponens
  1. ((P v Q) ⊃ (W & ~Y))
  2. (~Q & W)
  3. (X ⊃ Y)
  4. (P v Q) /.: (~X & ~Q)
  5. (~W & ~Y) 1, 4 modus ponens
  6. ~Y 5 simplification
  7. ~X 3, 6 modus tollens
  8. ~Q 2 simplification
  9. (~X & ~Q) 7, 8 conjunction

1. ~P

2. (S ⊃ R)

3. (R ⊃ Q)

4. (Q ⊃ P) /.: ~S

  1. ~Q 1, 4 modus tollens

  2. ~R 3, 5 modus tollens

  3. ~S 2, 6 modus tollens

  4. ~(B v D)

  5. (A ⊃ (B v D))

  6. (H ⊃ ((E & F) & G))

  7. H /.: (~A & E)

  8. ~A 1, 2 modus tollens

  9. ((E & F) & G) 3, 4 modus ponens

  10. (E & F) 6 simplification

  11. E 7 simplification

  12. (~A & E) 5, 8 conjunction

b.

  1. (~S ⊃ Q)

  2. (R ⊃ ~T)

  3. (~S v R) /.: (Q v ~T)

  4. (Q v ~T) 1-3 constructive dilemma

1. ((H ⊃ B) & (O ⊃ C))

  1. (Q ⊃ (H v O))
  2. Q / ... (B v C)
  3. (H v O) 2, 3 modus ponens
  4. (H ⊃ B) 1 simplification
  5. (O ⊃ C) 1 simplification
  6. (B v C) 4-6 constructive dilemma
  1. (B ⊃ (A v C))
  2. (B & ~A) /.: C
  3. B 2 simplification
  4. ~A 2 simplification
  5. (A v C) 1, 3 modus ponens
  6. C 4, 5 disjunctive syllogism

1. ((A & B) ⊃ ~C)

  1. (C v ~D)
  2. (A ⊃ B)
  3. (E & A) /.: ~D
  4. A 4 simplification
  5. B 3, 5 modus ponens
  6. (A & B) 5, 6 conjunction
  7. ~C 1, 7 modus ponens
  8. ~D 2, 8 disjunctive syllogism

1. (F ⊃ (G ⊃ ~H))

  1. ((F & ~W) ⊃ (G v T))
  2. (F & ~T)
  3. (W ⊃ T) /.: ~H
  4. F 3 simplification
  5. ~T 3 simplification
  6. ~W 4, 6 modus tollens
  7. (F & ~W) 5, 7 conjunction
  8. (G v T) 2, 8 modus ponens
  9. G 6, 9 disjunctive syllogism
  10. (G ⊃ ~H) 1, 5 modus ponens
  11. ~H 10, 11 modus ponens

Getti ng familiar with… rules of replacement.

  1. ( ~ (P ≡ R) v ~ (Q & S))

  2. ~((P ≡ R) & (Q & S)) DeMorgan’s Law

  1. ~~ (A & B) v (Q ⊃ R)
  2. (A & B) v (Q ⊃ R) Double Negation

1. ((P & Q) ⊃ R)

2. ~R ⊃ ~(P & Q)

Transposition

1. (R & Z)

  1. (R & Z) v (R & Z) Tautology
  1. (Q v (R & S))
  2. ((Q v R) & (Q v S)) Distribution
  1. ((A v B) v (~C v ~D))
  2. ~(A v B)
  3. ~~ D /.: ~C
  4. C assumption for indirect proof
  5. (~C v ~D) 1, 2 disjunctive syllogism
  6. ~~C 4 double negation
  7. ~D 5, 6 disjunctive syllogism
  8. D 3 double negation
  9. (D & ~D) 7, 8 conjunction
  10. ~C 4-9 indirect proof
  1. (((M v N) & (O & P)) & (Q v R))
  2. (A & B) /.: (P & B)
  3. ~(P & B) assumption for indirect proof
  4. (~P v ~B) 3 DeMorgan’s Law
  5. B 2 simplification
  6. ~~B 5 double negation
  7. ~P 4, 6 disjunctive syllogism
  8. ((M v N) & (O & P)) 1 simplification
  9. (O & P) 8 simplification
  10. P 9 simplification
  11. (P & ~P) 7, 10 conjunction
  12. (P & B) 3-11 indirect proof

1. A

  1. ((A v B) ⊃ ~C)
  2. (D ⊃ ~~ C) /.: ~D
  3. D assumption for indirect proof
  4. ~~C 3, 4 modus ponens
  5. ~(A v B) 2, 5 modus tollens 7. (~A & ~B) 6 DeMorgan’s Law
  6. ~A 7 simplification
  7. (A & ~A) 1, 8 conjunction
  8. ~D 4-9 indirect proof

1. B

  1. ((B v D) ⊃ ~H)
  2. (H v F) /.: (C ⊃ F)
  3. C assumption for conditional proof
  4. (B v D) 1 addition
  5. ~H 2, 5 modus ponens
  6. F 3, 6 disjunctive syllogism
  7. (C ⊃ F) 4-7 conditional proof
  1. ((M ⊃ O) v S)
  2. ((~S & N) & M)
  3. M
  4. (P & ~O) /.: (S v B)
  5. ~(S v B) assumption for indirect proof
  6. ~O 4 simplification
  7. (~S & N) 2 simplification
  8. ~S 7 simplification
  9. (M ⊃ O) 1, 8 disjunctive syllogism
  10. O 3, 9 modus ponens
  11. (O & ~O) 6, 10 conjunction
  12. (S v B) 5-11 indirect proof
  1. (X v Y)
  2. ((X & W) ⊃ (Z ⊃ Y))
  3. (~Y & W)
  4. Z /.: R
  5. ~R assumption for indirect proof
  6. ~Y 3 simplification
  7. X 1, 6 disjunctive syllogism
  8. W 3 simplification
  9. (X & W) 7, 8 conjunction
  10. (Z ⊃ Y) 2, 9 modus ponens
  11. Y 4, 10 modus ponens
  12. (Y & ~Y) 6, 11 conjunction
  13. R 5-12 indirect proof
  1. It is either raining or storming.
  2. It is certainly raining.
  3. Thus, it is not storming.

Affirming the disjunct

  1. If it drops below 0o^ C, either the roads will become icy or the water line will freeze.
  2. It is -5o^ C (below 0o).
  3. So, either the roads will become icy or the water line will freeze.
  4. The roads are icy.
  5. Therefore, the water line is probably not frozen.

Affirming the disjunct

b.

  1. Affirming the disjunct
  2. Either the Bulls will win or the Suns will.
  3. The Bulls will win.
  4. So, the Suns will not win.

If you’re worried that this inference is a good one because only one team can win, remember that if only one team could win, then the teams are playing each other and the “or” is exclusive. But we cannot assume the “or” is exclusive unless it is explicitly stated. In this case, the team could be playing different teams or in different tournaments.

  1. Affirming the consequent
  2. If the road is wet, your tires won’t have as much traction.
  3. You won’t have as much traction.
  4. Therefore, the road is wet.

Why is this fallacious? Because the road’s being wet is one reason you won’t have good traction, but it is certainly not the only reason. There may be ice on the road, or your tires may be bald.

  1. Denying the antecedent
  2. If the bar is close, it will be safe to drive home.
  3. The bar is not close.
  4. So, it won’t be safe to drive home.

This is fallacious because, even thought the bar’s proximity is one reason it will be safe to drive home, there may be others. For instance, the driver is not drunk, the roads are not slippery, it is not late at night, etc.

  1. Affirming the consequent
  2. We will win only if we strengthen our defense.
  3. We have strengthened our defense.
  4. Therefore, we will win.

Strengthening the defense may be a necessary condition for winning, but it is certainly not sufficient. You still have to play the game, your team members have to be in good shape, you have to outplay the other team, etc.

  1. Affirming the disjunct
  2. They will break up unless she is honest.
  3. She is honest.
  4. Therefore, they will not break up.

Notice how the inclusive “or” helps us here. They could break up for a number of reasons. If she is not honest, they will break up. That would be the valid conclusion of a disjunctive syllogism. But if she is honest, who knows what will happen? They may break up anyway, perhaps she was too honest; perhaps what she was honest about is a reason to break up. Maybe being honest increases the chances they will stay together, but it doesn’t guarantee it.