Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Q1. What is a statement? Q2. How do you test to see whether two statement forms

ID: 668970 • Letter: Q

Question

Q1. What is a statement? Q2. How do you test to see whether two statement forms are logically equivalent? Q3. Determine whether the statement forms are logically equivalent. In each case, construct a truth table and include a sentence justifying your answer. a. p v (p ^ q) and p b. (p ^ q)^r and p^(q^r) c. similar to (p ^ q) and similar to pA similar to q d. similar to (p v q) and similar to pA similar to q Q4. Use truth tables to establish which of the following forms are tautologies and which are contradiction? a. ((similar to p ^ q)^(q ^ r))^ similar to q b. (similar to p v q) V (p ^ similar to q)

Explanation / Answer

Q1.
Statement is an instruction for performing some action in Programming Language.

Q2.
To test whether two statements are logically equivalent we use conditional statements like if, if-else, switch.

Q3.

p

q

p^q

pv(p^q)

pv(p^q) and p

0

0

0

0

0

0

1

0

0

0

1

0

0

1

1

1

1

0

1

1

From above TT we can say pv(p^q) and p are equal

(p^q)^r and p^(q^r)

p

q

r

p^q

q^r

(p^q)^r

p^(q^r)

0

0

0

0

0

0

0

0

0

1

0

0

0

0

0

1

0

0

0

0

0

0

1

1

0

1

0

0

1

0

0

0

0

0

0

1

0

1

0

0

0

0

1

1

0

1

0

0

0

1

1

1

1

1

1

1

From above TT we can say (p^q)^r and p^(q^r) are equal

~(p^q) and ~p^~q

p

q

~p

~q

~(p^q)

~p^~q

0

0

1

1

1

1

0

1

1

0

1

0

1

0

0

1

1

0

1

1

0

0

0

0

~(p^q) and ~p^~q is not equivalent

~(pvq) and ~p^~q

p

q

~p

~q

~(pvq)

~p^~q

0

0

1

1

1

1

0

1

1

0

0

0

1

0

0

1

0

0

1

1

0

0

0

0

~(pvq) and ~p^~q are equivalent

p

q

p^q

pv(p^q)

pv(p^q) and p

0

0

0

0

0

0

1

0

0

0

1

0

0

1

1

1

1

0

1

1