This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ¬∃ x ( H ( x ) ∧ A ( x )) ≡ ∀ x ( ¬ H ( x ) ∧ A ( x )) ≡ ∀ x ( ¬ H ( x ) ∨ ¬ A ( x ). Of course, there are other things this is equivalent to. A correct translation might be “No horse can add”. b) Every koala can climb. Let K ( x ) mean “ x can add”, C ( x ) mean “ x can climb”. Then we can interpret this statement as ∀ x ( K ( x ) → C ( x )) The negation is ¬∀ x ( K ( x ) → C ( x )) ≡ ∃ x ¬ ( K ( x ) → C ( x )) ≡ ∃ x ( K ( x ) ∧ C ( x )). A proper translation might be “There exists a koala that cannot climb”. 1...
View
Full
Document
This note was uploaded on 08/11/2008 for the course MATH 240 taught by Professor Miller during the Fall '08 term at University of Wisconsin.
 Fall '08
 Miller
 Math, Logic

Click to edit the document details