Propositional Logic: Semantics & Satisfiablity
What is the truth value of (p ∧ q) when p = True and q = False?
Which of the following represents the negation of p?
In a truth table for two variables (p and q), how many rows are needed?
What is the truth value of (p → q) when p = False and q = True?
Which formula is logically equivalent to ¬(p ∧ q)?
A formula is called 'satisfiable' when:
Consider the formula ((p ∧ q) → r) ∧ (¬r ∧ p). When this formula is satisfiable, what must be the value of q?
How many different truth assignments satisfy the formula (p ∨ q) ∧ (¬p ∨ r) ∧ (¬q ∨ ¬r)?
Which of the following best describes the relationship between validity and satisfiability?