Welcome! Log In Create A New Profile


pp169 - proof negation 3

Posted by Anonymous User 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Anonymous User
pp169 - proof negation 3
April 28, 2008 01:07PM
Could someone help me complete this proof please? The goal is to prove P.
| P or Q
| ¬Q
├-- P
| - P     reiteration (3)
├-- Q
| - â”´     contradiction intro (2,5)
I can't prove P in line 7.
Re: pp169 - proof negation 3
May 21, 2008 11:29AM
Line 7:
P â”´ ELim: 6
Re: pp169 - proof negation 3
May 21, 2008 11:39AM
Hi again Rick - Eplanation for the above: P159 in textbook - rule for contradiction elimination.
If you get a contradiction, you can assert any FOL sentence whatsoever.
Anonymous User
Re: pp169 - proof negation 3
May 21, 2008 12:27PM
Thanks smiling smiley
Sorry, only registered users may post in this forum.

Click here to login