How Many Cases Do I Need to Consider for Proof by Contradiction?

Click For Summary

Homework Help Overview

The discussion revolves around proving a logical statement by contradiction, specifically the implication P → (Q ∧ Z). Participants are exploring the necessary cases to consider when negating the conjunction (Q ∧ Z).

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants discuss whether it is sufficient to demonstrate a contradiction in just one of the cases where (Q ∧ Z) is false, or if all cases must be considered. There is also a question about the completeness of the proof when assuming one case to be true.

Discussion Status

Some participants suggest that proving one case is enough, while others question this approach, indicating a lack of consensus on the necessity of addressing all cases. Guidance has been offered regarding the implications of the logical structure, but uncertainty remains about the completeness of the proof.

Contextual Notes

Participants are navigating the requirements of their homework, which may impose specific expectations on the proof structure. There is mention of differing interpretations based on potential teacher preferences.

cris(c)
Messages
21
Reaction score
0

Homework Statement



Suppose I want to prove the following statement by contradiction:
[itex]P \longrightarrow (Q \land Z)[/itex]

Homework Equations



If [itex](Q \land Z)[/itex] is false, then either: (i) Q is false and Z is true; (ii) Q is true and Z is false; (iii) Q and Z are false.

The Attempt at a Solution



Do I need to consider all possible cases in which [itex](Q \land Z)[/itex] is false and arrive to a contradiction or it suffices to show a contradiction in only one possible of the three possible cases?

Thanks for your help!
 
Physics news on Phys.org
If you want to prove the first one is true all you have to do is prove it by only one of the cases, because QandZ is false only if one of those cases occurs, but depending on what your teacher wants you can do all three cases.
 
mtayab1994 said:
If you want to prove the first one is true all you have to do is prove it by only one of the cases, because QandZ is false only if one of those cases occurs, but depending on what your teacher wants you can do all three cases.

This means that the proof is complete if I assume (say) case (i) to be true and arrive to a contradiction?
 
cris(c) said:
This means that the proof is complete if I assume (say) case (i) to be true and arrive to a contradiction?

Yes because Q and Z could only be true if Q and Z are both true or if Q and Z are both false, therefore all you have to do is prove it using one case. Hope this helps you.
 
mtayab1994 said:
Yes because Q and Z could only be true if Q and Z are both true or if Q and Z are both false, therefore all you have to do is prove it using one case. Hope this helps you.

Think I got it. Thanks a lot!
 
No Problem.
 
mtayab1994 said:
No Problem.

Hi again,

It appears that your answer is not completely correct or I am truly messed up. Negating (Q and Z) means that either (Q and not Z) or (Z and not Q). Hence, to actually show that P implies (Q and Z), don't we need to show that both of the above cases aren't possible true? I mean, showing that P implies (Z and not Q) does not exclude the possibility that (Q and not Z) still is true, does it?

Thanks!
 

Similar threads

Replies
5
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
9
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K