The document contains 4 truth tables that represent different logical expressions:
1. The first truth table represents the expression "~ [(p∨q) ∧ ~q]" and has 4 rows showing the possible combinations of values for p and q and the resulting values for the subexpressions and the overall expression.
2. The second truth table is for the expression "(~p → q) ∨ (~p ∧ ~q)" and again has 4 rows showing the variable assignments and resulting truth values.
3. The third truth table is for the expression "[ p ∧ (q ∨ ~r) ] → (~p ∧ q)" and has 7 rows to account for all possible combinations of p
The document contains 4 truth tables that represent different logical expressions:
1. The first truth table represents the expression "~ [(p∨q) ∧ ~q]" and has 4 rows showing the possible combinations of values for p and q and the resulting values for the subexpressions and the overall expression.
2. The second truth table is for the expression "(~p → q) ∨ (~p ∧ ~q)" and again has 4 rows showing the variable assignments and resulting truth values.
3. The third truth table is for the expression "[ p ∧ (q ∨ ~r) ] → (~p ∧ q)" and has 7 rows to account for all possible combinations of p
The document contains 4 truth tables that represent different logical expressions:
1. The first truth table represents the expression "~ [(p∨q) ∧ ~q]" and has 4 rows showing the possible combinations of values for p and q and the resulting values for the subexpressions and the overall expression.
2. The second truth table is for the expression "(~p → q) ∨ (~p ∧ ~q)" and again has 4 rows showing the variable assignments and resulting truth values.
3. The third truth table is for the expression "[ p ∧ (q ∨ ~r) ] → (~p ∧ q)" and has 7 rows to account for all possible combinations of p
The document contains 4 truth tables that represent different logical expressions:
1. The first truth table represents the expression "~ [(p∨q) ∧ ~q]" and has 4 rows showing the possible combinations of values for p and q and the resulting values for the subexpressions and the overall expression.
2. The second truth table is for the expression "(~p → q) ∨ (~p ∧ ~q)" and again has 4 rows showing the variable assignments and resulting truth values.
3. The third truth table is for the expression "[ p ∧ (q ∨ ~r) ] → (~p ∧ q)" and has 7 rows to account for all possible combinations of p