a) How many rows are needed for the truth table of the compound statement (p ˅ ¬q) ↔ [(¬r ˄ s) → t], where p, q, r, s, and t are primitive statements?
b) Let p1, p2, … ,pn, denote n primitive statements. Let p be a compound statement that contains at least one occurrence each of pi, for 1 ≤ i ≤ n — and p contains no other primitive statement. How many rows are needed to construct the truth table for p?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.