Proofing Implications Using Negation: P=>Q & ¬P=>Q

  • MHB
  • Thread starter aconti
  • Start date
In summary, the two given proofs show how to derive the conclusion of PvQ using negation introduction and elimination. The first proof uses the derivation method of modus ponens while the second proof uses the method of contradiction. Both methods are valid and can be applied to similar proofs.
  • #1
aconti
1
0
1st proof: ¬P=>Q |- PvQ

2nd proof: P=>Q |- ¬PvQ

I think negation introduction and negation elimination should be used, can you share any thoughts on how you would work out the above?

Thanks
 
Physics news on Phys.org
  • #2
aconti said:
1st proof: ¬P=>Q |- PvQ

2nd proof: P=>Q |- ¬PvQ

I think negation introduction and negation elimination should be used, can you share any thoughts on how you would work out the above?

Thanks

For the 1st one:

Proof :

1) ~P=>Q.....................Given

2) ~(PVQ)..................Assumption to lead to a contradiction

3) ~P & ~Q...................2, D.Morgan

4) ~P....................3, Addition Elimination

5) ~Q ....................3,Addition Elimination

6) Q.....................1,4 M.Ponens

7) Q&~Q ...................5,6 Addition Introduction

8) PVQ....................2 to 7 and Contradiction

Can you do the 2nd exescise also by contradiction ??
 

Related to Proofing Implications Using Negation: P=>Q & ¬P=>Q

1. What is the purpose of proofing implications using negation?

The purpose of proofing implications using negation is to determine the validity of a statement or argument. By using the negation of a statement, we can show that the original statement leads to a contradiction, thus proving it to be false.

2. How do you write a proof using negation?

To write a proof using negation, you start by assuming the opposite of the statement you want to prove. Then, you use logical steps and rules to reach a contradiction. This shows that the original statement is true.

3. What is the difference between P=>Q and ¬P=>Q?

P=>Q is the conditional statement "If P, then Q", while ¬P=>Q is the conditional statement "If not P, then Q". The main difference is the use of negation in the second statement, which can lead to different implications and conclusions.

4. Can you give an example of proofing using negation?

Sure, let's say we want to prove the statement "If n is an even number, then n+1 is an odd number." We can do this by assuming that the opposite is true, that is, "If n is an even number, then n+1 is an even number." From there, we can use logical steps to show that this leads to a contradiction, thus proving our original statement to be true.

5. What are the key principles to keep in mind when proofing using negation?

When proofing using negation, it is important to remember to start by assuming the opposite of the statement you want to prove, use logical steps and rules to reach a contradiction, and be clear and concise in your reasoning and conclusions.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
901
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
882
  • Set Theory, Logic, Probability, Statistics
Replies
16
Views
2K
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
0
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
2K
Back
Top