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

1. Sep 18, 2008

### evagelos

How do we prove in propositional calculus :

......p^(qvr) <===> (p^q)v(p^r) semantically and syntactically

2. Sep 19, 2008

### CompuChip

Well, what have you already come up with?

3. Sep 19, 2008

### HallsofIvy

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

4. Sep 19, 2008

### CompuChip

I had to Google as well, as far as I http://www.rci.rutgers.edu/~cfs/472_html/Logic_KR/proplogic_proofs472.html [Broken], using truth tables would be the semantic proof.

Last edited by a moderator: May 3, 2017
5. Sep 19, 2008

### evagelos

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

6. Sep 20, 2008

### CompuChip

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

Share this great discussion with others via Reddit, Google+, Twitter, or Facebook