Write the negation of the statement “0 < 1” in five different ways. Four of those ways should steer clear of all “not” words (like “not”, “no”, “false”, etc.).

ANSWER #5

Q4. Simplify the following sentences in predicate logic so that all the negation symbols are directly in front of a predicate. (For example, Vr (-0(1)) (-E(r))) is simplified, because the negation symbols are directly in front of the predicates O and E. However, Vr -(P(x) V E(x)) is not simplified.) (i) -(3r (P(x) V (E(x) → S(x)))) (ii) -(Vz (E(r) A (P(x) →¬(3y G(x, y))) Q5. Write a sentence in predicate logic (using the same predicates as above) which is true when the domain is the class of positive integers (1, 2, 3, ...), but is false when the domain is the class of all integers (...,-2, -1,0, 1, 2, ...). (You do not need to explain your answer.)

47,