a) Show that ?xP(x) ???xQ(x) is logically equivalent to ?x?y (P(x) ??Q(y)), where all quantifiers have the same nonempty domain. b) Show that ?xP(x) ???xQ(x) is equivalent to ?x?y (P (x) ??Q(y)), where all quantifiers have the same nonempty domain. A statement is in prenex normal form (PNF) if and only if it is of the form Q1x1Q2x2úúúQkxkP(x1, x2, . . . , xk), where each Qi, i = 1, 2, . . . , k, is either the existential quantifier or the universal quantifier, and P(x1, . . . , xk) is a predicate involving no quantifiers. For example, ?x?y(P(x, y) ??Q(y)) is in prenex normal form, whereas ?xP(x) ???xQ(x) is not (because the quantifiers do not all occur first) is not (because the quantifiers do not all occur first). Every statement formed from propositional variables, predicates, T, and F using logical connectives and quantifiers is equivalent to a statement in prenex normal form. Exercise 51 asks for a proof of this fact.
Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.
[order_calculator]