Fewest number of steps, no truth tables show \[[(p\lor q)\land (p\rightarrow r)\land (q\rightarrow r)]\rightarrow r\] is a tautology
fewest steps would be the wolf I think
i know it is true and i can see why, but i cannot make the steps
p>r = -pvr q>r = -qvr
i don't want a truth table
these are identities and operations
[]>r = -[]vr
wrote it out twice and got lost in the damned ps and qs had \[[(p\lor q)\land(\lnot p\lor r)\land (\lnot q \lor r)]\rightarrow r\] then \[\lnot[(p\lor q)\land(\lnot p\lor r)\land (\lnot q \lor r)]\lor r\]
-(pvq)-n-(-pvr)-n-(-qvr) v r (-pn-q) v (pn-r) v (qn-r) v r
\[[\lnot(p\lor q)\lor \lnot(\lnot p\lor r)\lor \lnot(\lnot q \lor r)]\lor r\]
(-pn-q) v (pn-r) v (qn-r) v r (-pn-q) v (pn-r) v (qvr) n (-rvr) =r (-pn-q) v (pn-r) v (qvr) n r (-pn-q) v (-r) v (qvr) (-pn-q) v (-rvq) v (-rvr) =r (-pn-q) v (-rvq) v r (-pn-q) v (rvq) so far
ok just about where you are \[[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\land \lnot r)]\lor r\]
(-pn-q) v r v q (-pv q) n (-qv q) v r =q (-p v q v r ) n q = q perhaps
problem is i want T
thats not a T tho is it
i am good to here \[[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\land \lnot r)]\lor r\] and i can move these around any way i like, bu i cannot seem to get rid of anything
undistribute maybe
oh maybe i can factor a not r out of the last two terms before the "or r"??
yep
which gets me what?
(pvq) n -r
maybe \[(p\lor q)\land \lnot r\]
since you got all vs inbetween the [ ] seem rather useless
ok so \[[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\land \lnot r)]\lor r\] \[[(\lnot p\land \lnot q)\lor (( p\lor q)\land \lnot r)\lor r\]
distribute your vr threw
\[(\lnot p\land \lnot q)\lor (( p\lor q)\land \lnot r)\lor r\]
looks like i should be close right??
perhaps (-pnq) v [(pvqvr) n (-rvr)] =r (-pnq) v [(pvqvr) n r] (-pnq) v (pnr) v(qnr) v (rnr) maybe?
that might be a cirle lol
aaaaaaaaaaaaaaaaaaaaaargh
\[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\land \lnot r)\lor r\] \[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\lor r) \land (\lnot r\lor r)\] \[(\lnot p\land \lnot q)\lor ( p\land \lnot r)\lor (q\lor r) \land r\] ugh is right
ok i think i may have it please check
starting here \[(\lnot p\land \lnot q)\lor (( p\lor q)\land \lnot r)\lor r\]
-rvr = T right?
\[(\lnot p\land \lnot q)\lor r \lor (( p\lor q)\land \lnot r)\] \[(\lnot p\land \lnot q)\lor (r\lor (p\lor q) \land (r \lor \lnot r)\]\]
\[(\lnot p\land \lnot q)\lor (r\lor (p\lor q)) \land T\]\]
\[((\lnot p \land \lnot q)\lor r \lor (p\lor q)\]
\[\lnot( p \lor q) \lor r \lor (p \lor q)\] \[\lnot (p\lor q) \lor (p\lor q) \lor r)\] \[T\lor r\] TTTTTTTTTTTTTTTTTTTTTTTTTTT
would it be easier with truth table?
maybe? probably took 8 too many steps
looks good to me :)
i wanted to do it without truth tables and got all messed up
you could just do this with words
ok zarkon, lets see 2 steps
not is 2 steps
yeah i feel this way about all this nonsense lots of symbols for the completely obvious
as a professor i once had (who sadly recently died) "just because it is obvious, doesn't mean you can't prove it"
\[[(p\lor q)\land (p\rightarrow r)\land (q\rightarrow r)]\rightarrow r\] if r is true then the whole thing is true so assume r is false. then for the statement to be false the lhs has to be true this tells us p and q must be false (otherwise the two implications would be false) but then p or q is false and the lhs is false...thus the statement is always true
I should probably write ...this tells us p is false and q is false
[ (p + q) x (p->r) x (q->r) ] -> r ¬ [ (p + q) x (¬p + r) x (¬q + r) ] + r a->b becomes ¬a + b ¬(p+q) + (p x ¬r) + (q x ¬r) + r ¬(a + b) becomes ¬a x ¬b and ¬(a x b) becomes ¬a + ¬b ¬(p+q) + r + ((p + q) x ¬r) commute +r, factor out (p+q) (¬(p+q) + r) + ¬(¬(p + q) + r) ¬a x ¬b becomes ¬(a + b)
no claims to being the shortest.
yes it looks nice and short!
sarcasm? :D
no no you should have see what i wrote!
im too tired to unravel it, beacuse you tend to go back, lol
Join our real-time social learning platform and learn together with your friends!