ajprincess
  • ajprincess
prove\[(\neg p\wedge(\neg q\wedge r))\vee(q\wedge r)\vee(p\wedge q)=r\]
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
ajprincess
  • ajprincess
|dw:1338094648240:dw| prove this using laws of algebra of propositions.
ajprincess
  • ajprincess
@amistre64, @jamesJ, @turingtest
ajprincess
  • ajprincess
plzzz help me.

Looking for something else?

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

More answers

ajprincess
  • ajprincess
|dw:1338095286775:dw| Except this other all are right.
ajprincess
  • ajprincess
ya sure. thanx. :) can u help me to prove it if u dnt mind.
TuringTest
  • TuringTest
not used to this kind of thing,; I'm not sure what the technically right approach would be start making assumptions I guess...
ajprincess
  • ajprincess
ha k. thanx. @jamesJ if u dnt can u plzzz help me with this question?
ajprincess
  • ajprincess
*mind
JamesJ
  • JamesJ
How have you proved these sorts of things in the past? The most straight-forward way to show this would be write out a truth table with eight rows, one row for each of the truth value combinations of p, q and r
ajprincess
  • ajprincess
i am ok with proving it using truth table. this is one of my past paper question. they hav askd to prove t using laws of algebra of propositions. bt I am nt ued to it.
ajprincess
  • ajprincess
@asnaseer can u plzz help me vth this if u dnt mind.
ajprincess
  • ajprincess
@JamesJ u too. can u help me plzzz
JamesJ
  • JamesJ
So you want to prove this now using propositions?
ajprincess
  • ajprincess
ya.
ajprincess
  • ajprincess
I tried bt was unable to get t.
JamesJ
  • JamesJ
I just constructed the truth table and the question as written here looks wrong. Could you please triple check it.
ajprincess
  • ajprincess
ha k.
JamesJ
  • JamesJ
I think it might be this, but you check it! \[ (\neg p\wedge(\neg q\wedge r))\vee(q\wedge r)\vee(p\wedge r)=r \]
ajprincess
  • ajprincess
ya that's it. sooo sorrry for the mistake.
JamesJ
  • JamesJ
ok, well you factor out ^ r from each of these terms and you have ( ~p^~q) v q v p ) ^ r
JamesJ
  • JamesJ
and ( ~p^~q) v q v p is always true. Hence the entire expression is equivalent to TRUE ^ r = r
ajprincess
  • ajprincess
bt hw do v knw that ( ~p^~q) v q v p is always true?
JamesJ
  • JamesJ
because ~p^~q = ~(p v q) and hence (~p^~q) v q v p = ~(p v q) v (p v q)
JamesJ
  • JamesJ
...and X v ~X is always true.
ajprincess
  • ajprincess
I get t nw. thanxxxxxxxx a lot.

Looking for something else?

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