The domain for this problem is some unspecified collection of numbers. Consider the predicate P(x, y) = "x is greater than y." (a) Translate the following statement into predicate logic. Every number has a number that is greater than it. (x)(3)(x, y) (((x) (3x)(V)(x,x) (x)(3)(y,x) (3x)(3y)P(y,x) X (b) Negate your expression from part (a), and simplify it so that no quantifier or connective lies within the scope of a neg. (3x)(3)(~P(y, x)) (((()) (3))(-P(x, y)) ((((, x)) (x)(3)(~P(x, x)) X (c) Translate your expression from part (b) into understandable English. Don't use variables in your English translation. O All numbers have a number that they are less than or equal to. O There is a number that has a number that it is less than or equal to. O There is a number that all numbers are greater than or equal to. There is a number that all numbers are less than or equal to. O All numbers are less than or equal to all numbers.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

asnwer a and b only.

The domain for this problem is some unspecified collection of numbers. Consider the predicate
P(x, y) = "x is greater than y."
(a) Translate the following statement into predicate logic.
Every number has a number that is greater than it.
(vx)(3)P(x, y)
(x)(V)(x,x)
(3x)(v)P(x,x)
(V)(3)(x,x)
(3x)(3y)P(y,x)
X
(b) Negate your expression from part (a), and simplify it so that no quantifier or connective lies within the scope of a negation.
(3x)(3)(-P(y, x))
((((, x))
(3x)(V)(-P(x, y))
(3x)(V)(Py, x))
(vx)(3)(~P(y, x))
X
(c) Translate your expression from part (b) into understandable English. Don't use variables in your English translation.
O All numbers have a number that they are less than or equal to.
There is a number that has a number that it is less than or equal to.
O There is a number that all numbers are greater than or equal to.
There is a number that all numbers are less than or equal to.
O All numbers are less than or equal to all numbers.
Transcribed Image Text:The domain for this problem is some unspecified collection of numbers. Consider the predicate P(x, y) = "x is greater than y." (a) Translate the following statement into predicate logic. Every number has a number that is greater than it. (vx)(3)P(x, y) (x)(V)(x,x) (3x)(v)P(x,x) (V)(3)(x,x) (3x)(3y)P(y,x) X (b) Negate your expression from part (a), and simplify it so that no quantifier or connective lies within the scope of a negation. (3x)(3)(-P(y, x)) ((((, x)) (3x)(V)(-P(x, y)) (3x)(V)(Py, x)) (vx)(3)(~P(y, x)) X (c) Translate your expression from part (b) into understandable English. Don't use variables in your English translation. O All numbers have a number that they are less than or equal to. There is a number that has a number that it is less than or equal to. O There is a number that all numbers are greater than or equal to. There is a number that all numbers are less than or equal to. O All numbers are less than or equal to all numbers.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Inference
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education