Skip to main content

Subsection 3.6.4 Contradictory Premises and Conditionalization Proof Problem

Prove: ¬( qs )

qp

¬ p

  • sr

Notice that you’ve seen this problem before. This time, use Conditionalization to complete your proof.

You can also watch our video, which will outline our strategy for doing this.

Video cover image

Conditionalization Problems

Exercises Exercises

Exercise Group.

1.

1. Prove: ( A ∧ (¬ B ∧ ¬ C )) → ( A ∨ ¬( BC ))

(Hint: Think about using Simplification and/or Addition to remove terms from a conjunction or add terms to a disjunction.)

Answer.
Solution.
Invoke Querium ---PsQs15 [1] \(A  (B  C)\) (Conditional) Premise [2] \(A\) Simplification [1] [3] \(A  (B  C) \) Addition [2] [4] \((A  (B  C))  (A  (B  C))\) Conditional Discharge [1], [3]
2.

We know that the show starts at 7 or 8 on some day. We want to show that if it is not true that the show starts on Saturday at 7 then, if it starts at Saturday at a time other than 8, they will burn down the theater.

Assign the following names to basic statements:

E : Show is E arly (at 7).

L : Show is L ate (at 8).

S : Show is on S aturday.

B : Theater B urns down.

Prove: EL

  • (¬( ES )) → (( S ∧ ¬ L ) → B )

(Hint: Employ the Conditionalization rule more than once.)

Answer.
Invoke Querium. ---Theater questionId: Theater problemType: gradeLogicProof questionTitle: Using Conditionalization questionDisplayText: none problemGoal: ((E  S))  ((S  L)  B) initialProblemState: the one premise hints: Employ the Conditionalization rule more than once. *** [1] E  L Premise [2] (E  S) (Conditional) Premise [3] S  L (Conditional) Premise [4] S Simplification [3] [5] E  S De Morgan [2] [6] E Disjunctive Syllogism [4], [5] [7] L Disjunctive Syllogism [1], [6] [8] L Simplification [3] [9] B Contradictory Premises [7], [8] [10] (S  L)  B Conditional Discharge [3], [9] [11] ((E  S))  ((S  L)  B) Conditional Discharge [2], [10]
Solution.
Explanation (to appear on new Quest slide after return from Querium): Notice the two uses of the Conditionalization rule (clearly marked with vertical lines so that we’re careful to discharge their premises). They are what let us form the implications that we need. You can see that, by the time we assert our conclusion [11], we have discharged both conditional premises.
3.

Either Joe or Mary or Sally will go to New York. If Paul stays home, then Joe will not go. Therefore, if Paul stays home and Mary does not go to New York, Sally must go to New York.

Assign the following names to basic statements:

J : Joe will go to New York.

M : Mary will go to New York.

S : Sally will go to New York.

P : Paul stays home.

Prove: J ∨ ( MS ) Joe or Mary or Sally will go to New York.

P → ¬ J If Paul stays home, Joe will not go to New York.

∴ ( P ∧ ¬ M ) → S If Paul stays home and Mary doesn’t go to NY, Sally must go to New York.

Answer.
Invoke Querium. ---NewYork questionId: NewYork problemType: gradeLogicProof questionTitle: Using Conditionalization questionDisplayText: none problemGoal: (P  M)  S initialProblemState: the two premises hints: none [1] J  (M  S) Premise [2] P  J Premise [3] P  M Conditional Premise [4] P Simplification [3] [5] J Modus Ponens [2], [4] [6] M Simplification [3] [7] J  M Conjunction [5], [6] [8] (J  M) De Morgan [7] [9] (J  M)  S Associativity of or [1] [10] S Disjunctive Syllogism [8], [9] [11] (P  M)  S Conditional Discharge [3], [10]
Solution.
4.

4. Prove that the following claim is a tautology (in other words, derive it without any premises):

p ∧ (¬ qp )) → q

Answer.
---PsQs40 Invoke Querium
Solution.