Show, by the use of replacement rules, that (-p ^ q) ^ (q→p) = F
are logically equivalent.
Show, by the use of the truth table (truth matrix), that the is a contradiction.
( pvq ) へ [ ( -p ) へ ( -q ) ]
Show that -p > (q → r) and q → (p V r) are logically equivalent.
Symbolize the following by using qualifiers, predicates and logical connectives.
Let R be the relation on the set A = {a, b, c, d, e, f} and
R = {(a,a), (a,c ), (b,a ), (b b), (c,b), (c,c), (d,d), (d,c)}
Obtain transitive closure of R using Warshall’s algorithm.
D. Write in the form " if p then q", then write converse, inverse and contra positive of each of the following implications.
Express each of these propositions as an English sentence:
C. Let p and q be propositions
p: 4 is a rational number
q: √3 is an irrational number
write the negation of these propositions