This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Problem 1. Are ( ) and logically equivalent? Justify your answer. No. For example if and are both assigned T, then ( ) is F and is T. In fact is logically equivalent to . So under any assignment of truth values to and these two sentential formulas get opposite truth values. 1 Problem 2. Indicate which of the following assertions of logical equivalence are true and which are false. (a) ( P ( ) Q ( ) ) P ( ) Q ( ) is true. (b) ( P ( ) Q ( ) ) P ( ) Q ( ) is false. (c) ( P ( ) Q ( ) ) P ( ) Q ( ) is false. (d) ( P ( ) Q ( ) ) P ( ) Q ( ) is false. 2 Problem 3. Let the domain of discourse be the real numbers. Determine whether each of the following is true or false. (a) 2 = 2 is true: Let be the same as . (b) = 2 is false: If is negative, it has no real square root....
View Full
Document
 Fall '08
 Patel,N

Click to edit the document details