Logic: Given ((p^¬q)v(¬p^q)) |- (p v q)
Ah, with or without the truth table? And whats your take on how to begin?
I'm pretty sure that truth tables are not allowed
I've started by assuming ¬(p v q) and hoping to prove by contradiction (Reductio Ad Absurdum)
any ideas?
hmm, what is the |-?
have you studied logic before?
because if you've studied logic, then surely you should know what that symbol is...
I have a general idea about logics, from digital electronics. This has to be similar right?
not quite
this is propositional logic
is that a \bot?
if it is, then this contradiction can be easily proved by truth table...
truth tables not allowed
Let be . Show that but that neither nor (Note: this question is using Propositional logic) My current attempt is this: 1. Given 2. Assume 3. Assume 4. Using "OR introduction" 5. Contradiction in lines 2 and 4 6. Derive using Reductio Ad Absurdum 7. Assume 8. Using "OR introduction" 9. Contradiction in lines 2 and 8 10. Derive using Reductio Ad Absurdum 11. Using "AND introduction"
copy and paste?
Join our real-time social learning platform and learn together with your friends!