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

  • Thread starter Thread starter aconti
  • Start date Start date
AI Thread Summary
The discussion focuses on proving implications using negation, specifically the proofs ¬P=>Q leading to PvQ and P=>Q leading to ¬PvQ. The first proof demonstrates that assuming ¬(PvQ) leads to a contradiction, thus validating the original implication. The user suggests employing negation introduction and elimination techniques to work through these proofs. The second proof is requested to be approached similarly, using a contradiction method. The conversation emphasizes logical reasoning and the application of formal proof techniques in propositional logic.
aconti
Messages
1
Reaction score
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
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 ??
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top