Ask your own question, for FREE!
Mathematics 9 Online
satellite73 (satellite73):

show \[[(p\rightarrow q)\land (q\rightarrow r)]\rightarrow (p\rightarrow r)\] is a tautology, without using truth tables

OpenStudy (anonymous):

Seems like transitivity.

OpenStudy (amistre64):

-[(p>q)n(q>r)] v (p>r) -(p>q) v -(q>r) v (p>r) -(-pvq) v -(-qvr) v (-pvr) (pn-q) v (qn-r) v -p v r

OpenStudy (anonymous):

it is entirely obvious, but somehow i get messed up at the last step

OpenStudy (anonymous):

ok so i am fine at \[(p\land \lnot q)\lor (q\land \lnot r)\lor (\lnot p \land r)\]

OpenStudy (amistre64):

(pn-q) v (qn-r) v-p vr -------------- (pv-p) n (-qv-p) v (qvr) n (-rvr) T n (-qv-p) v (qvr) n T (Tn-q) v (Tn-p) v (qnT) v (rnT) -q v-p v q v r (-qvq) v-p v r T v ..... = T

OpenStudy (anonymous):

Can't you just write that it represents a syllogism?

OpenStudy (anonymous):

@amistre, you lost me on the last line

OpenStudy (anonymous):

yeah i am trying to do it amistre way

OpenStudy (amistre64):

since we got all ors, and a T; the rest dont matter

OpenStudy (amistre64):

T or ? or ? or ? = T

OpenStudy (anonymous):

that is fine , but what is this (pn-q) v (qn-r) v-p vr ?

OpenStudy (amistre64):

oring -p to the first bit and r to the last bit i stacked them vertical; helps me see whats going on

OpenStudy (anonymous):

ok that is the line i need to get starting here \[(p\land \lnot q)\lor (q\land \lnot r)\lor (\lnot p \land r)\]

OpenStudy (amistre64):

\[(p\land \lnot q)\lor (q\land \lnot r)\lor (\lnot p \lor r)\]

OpenStudy (amistre64):

a -> changes to "v" not "n"

OpenStudy (amistre64):

p -> r :: -p v r

OpenStudy (anonymous):

ah ok so we have \[(p\land \lnot q)\lor (q\land \lnot r)\lor (\lnot p \lor r)\] and then \[(p\land \lnot q)\lor (q\land \lnot r)\lor \lnot p \lor r\] and then we are going to commute to \[\lnot p \lor (p \land \lnot q) \lor (q \land \lnot r) \lor q\]

OpenStudy (amistre64):

yep

OpenStudy (amistre64):

not a vq, vr

OpenStudy (amistre64):

good, and from there its cake walk; hot coals cake walk, but cake walk nonetheless :)

OpenStudy (anonymous):

\[(\lnot p \lor p )\land (\lnot p \lor \lnot q)\lor (q \lor r) \land (\lnot r \lor r)\]

OpenStudy (anonymous):

i think that is right now yes?

OpenStudy (amistre64):

yep; then we can T off the sides and distribute thru the middles which cancels out the ts

OpenStudy (anonymous):

god this makes my head spin. thanks

OpenStudy (amistre64):

yeah, i blame guass lol

OpenStudy (anonymous):

well i tried to do this on the fly and got hopelessly stuck, then i tried it again and got stuck again not on the fly. thanks for straightening it out!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!