Proof of p^(qvr) <==> (p^q)v(p^r)

  1. How do we prove in propositional calculus :

    ......p^(qvr) <===> (p^q)v(p^r) semantically and syntactically
     
  2. jcsd
  3. CompuChip

    CompuChip 4,299
    Science Advisor
    Homework Helper

    Well, what have you already come up with?
     
  4. HallsofIvy

    HallsofIvy 40,386
    Staff Emeritus
    Science Advisor

    Comparing truth tables will do it quickly and neatly. Are you not allowed to use that method?
     
  5. CompuChip

    CompuChip 4,299
    Science Advisor
    Homework Helper

    I had to Google as well, as far as I can see, using truth tables would be the semantic proof.
     
  6. Semantical proof without using true tables ,i have one in mind but i am not very positive about it.Then syntactically how about a contradiction you think it could work ,although it looks a bit messy
     
  7. CompuChip

    CompuChip 4,299
    Science Advisor
    Homework Helper

    It is not quite clear to me what you mean by a semantical proof, and a syntactical one.
    Also, if you would post your idea we can have a look at it. Maybe you are on the right track but just need a last push, or maybe you even got it right but lack the confidence :wink:
     
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook

Have something to add?