Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

dwally89

  • 4 years ago

Logic: Given ((p^¬q)v(¬p^q)) |- (p v q)

  • This Question is Open
  1. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Ah, with or without the truth table? And whats your take on how to begin?

  2. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I'm pretty sure that truth tables are not allowed

  3. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I've started by assuming ¬(p v q) and hoping to prove by contradiction (Reductio Ad Absurdum)

  4. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    any ideas?

  5. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    hmm, what is the |-?

  6. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    have you studied logic before?

  7. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    because if you've studied logic, then surely you should know what that symbol is...

  8. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I have a general idea about logics, from digital electronics. This has to be similar right?

  9. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    not quite

  10. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    this is propositional logic

  11. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    is that a \bot?

  12. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    if it is, then this contradiction can be easily proved by truth table...

  13. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    truth tables not allowed

  14. shruti
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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"

  15. dwally89
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    copy and paste?

  16. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy