Propositional Logic: Semantics & Satisfiablity
What is the truth value of (p ∨ q) when p = False and q = True?
Which formula is logically equivalent to ¬(p ∨ q)?
In a truth table for three variables (p, q, r), how many rows represent assignments where exactly two variables are true?
What is the truth value of (p → q) when p = True and q = False?
Which formula represents the contrapositive of (p → q)?
A formula that is always false regardless of truth assignments is called:
Consider the formula (p ∧ q ∧ r) ∨ (¬p ∧ ¬q ∧ ¬r). This formula is:
Which of the following formulas is unsatisfiable?
Which of the following statements correctly describes the relationship between satisfiability and validity?