Using De Morgan's laws, write the negation of the following statements so that the negation never appears in front of a quantifier or of an expression involving logical connectives. a) 3x3y(P(x) → Q(y)) b) 3y(3xA(x, y) V VæB(x,y))

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%
Negating Formulas with Nested Quantifiers
De Morgan's laws allow to rewrite the negation of a disjunction or a conjunction in a logical
equivalent formula where the negation appears in front of the atomic propositions and not in front
of a compound proposition:
-(a A b) = ¬a V ¬6
¬(a v b) = ¬a ^ ¬b
Transcribed Image Text:Negating Formulas with Nested Quantifiers De Morgan's laws allow to rewrite the negation of a disjunction or a conjunction in a logical equivalent formula where the negation appears in front of the atomic propositions and not in front of a compound proposition: -(a A b) = ¬a V ¬6 ¬(a v b) = ¬a ^ ¬b
We have also seen how we can use so-called De Morgan's laws for quantifiers to rewrite negations
of sentences with quantifiers in a logically equivalent form where the negation operator does not
appear in front the quantifier:
-VxP(x) = 3x¬P(x)
-JxP(x) = Vx¬P(x)
Using these two forms of De Morgan's laws it is possible write the negation of formulas with nested
quantifiers in a logically equivalent form where the negation never appears in front of a quantifier or
of an expression involving logical connectives. For example,
-Væ3y(P(x, y) A Q(x,y)) = 3xVy(¬P(x,y) V ¬Q(x, y))
Note that in the second expression the negation operator only appears in front of P(x, y) and in
front of Q(x, y).
Using De Morgan's laws, write the negation of the following statements so that the negation never
appears in front of a quantifier or of an expression involving logical connectives.
a) 3x3y(P(x) → Q(y))
b) 3y(3xA(x, y) v VæB(x, y))
Transcribed Image Text:We have also seen how we can use so-called De Morgan's laws for quantifiers to rewrite negations of sentences with quantifiers in a logically equivalent form where the negation operator does not appear in front the quantifier: -VxP(x) = 3x¬P(x) -JxP(x) = Vx¬P(x) Using these two forms of De Morgan's laws it is possible write the negation of formulas with nested quantifiers in a logically equivalent form where the negation never appears in front of a quantifier or of an expression involving logical connectives. For example, -Væ3y(P(x, y) A Q(x,y)) = 3xVy(¬P(x,y) V ¬Q(x, y)) Note that in the second expression the negation operator only appears in front of P(x, y) and in front of Q(x, y). Using De Morgan's laws, write the negation of the following statements so that the negation never appears in front of a quantifier or of an expression involving logical connectives. a) 3x3y(P(x) → Q(y)) b) 3y(3xA(x, y) v VæB(x, y))
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,