Lecture 2 - Logical Combinators
and ∧ &
φ, Ψ : φ ∧ Ψ means both φ and Ψ are true conjunction.
φ, Ψ are called the conjuncts of φ∧Ψ
If φ, Ψ are both true, φ∧Ψ will be true
If φ or Ψ or both are false, then φ∧Ψ will be false
ASSIGNMENT 1 (for Lecture 1)
ASSIGNMENT 2 (for Lecture 2)
3. What strategy would you adopt to show that the conjunction φ1 ∧ φ2 ∧ . . . ∧ φn is true?
Show all of $φ1, φ2, . . . , φn$ are true.
4. What strategy would you adopt to show that the conjunction φ1 ∧ φ2 ∧ . . . ∧ φn is false?
Show that one of $φ1, φ2, . . . , φn$ is false.
7. What strategy would you adopt to show that the disjunction $φ1 ∨ φ2 ∨ . . . ∨ φn$ is true?
Show one of $φ1, φ2, . . . , φn$ is true
8. What strategy would you adopt to show that the disjunction φ1 ∨ φ2 ∨ . . . ∨ φn is false?
Show that all of $φ1, φ2, . . . , φn$ are false.