(p vv q)rarr r-=(p rarr r)^^(q rarr r)

Using truth table, prove the following logical equivalence (p^^q) rarr r -= p rarr (q rarr r)

The statement which is not a tautology is (p harr q)[(p rarr q)^^(q rarr q)] b.(p rarr q)vv(sim p rarr q) c.(p^^q)rarr(p vv q)d(p^^q)vv[(p vv q)rarr-q]

Answer the following questions Examine whether the statement pattern [p rarr (~q vv r)] harr ~[p rarr (q rarr r)] is a tautology, contradiction or contingency.

Construct truth tables for the following and indicate which of these are tautologies (p rarr q) rarr[(q rarrr)rarr(p rarr r)]

The logically equivalent proposition of p hArr q is (p^^q)vv(p^^q) b.(p rArr q)^^(p rArr q) c.(p^^q)vv(p rArr q) d.(p^^q)o+(p vv q)

Construct truth tables for the following and indicate which of these are tautologies [p rarr ( p vv q)] rarr [q rarr (p ^^ q)]

(p rArr q) ^^ (q rArr r) rArr (p rArr r) is

The converse of p rarr (q rarr r) is