How do we prove in propositional calculus : ......p^(qvr) <===> (p^q)v(p^r) semantically and syntactically
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
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