The following predicate logic formulas is invalid: Vx, 3y.P(x,y) = 3y, Vx.P(x, y) Indicate which of the following are counter models for this formula and briefly explain your reasoning. 1. The predicate P(x,y) ::= y+x = 1 where the domain of discourse is N. 2. The predicate P(x,y) ::= y·x = 2 where the domain of discourse is R without 0. 3. The predicate P(x,y)::= yxy = x where the domain of discourse is the set of all binary strings, including the empty string 2.
The following predicate logic formulas is invalid: Vx, 3y.P(x,y) = 3y, Vx.P(x, y) Indicate which of the following are counter models for this formula and briefly explain your reasoning. 1. The predicate P(x,y) ::= y+x = 1 where the domain of discourse is N. 2. The predicate P(x,y) ::= y·x = 2 where the domain of discourse is R without 0. 3. The predicate P(x,y)::= yxy = x where the domain of discourse is the set of all binary strings, including the empty string 2.
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
Related questions
Question
Logic, set and relations. Discrete math using Latex
![The following predicate logic formulas is invalid:
Vx, 3y.P(x, y) = 3y, Vx.P(x, y)
Indicate which of the following are counter models for this formula and briefly explain your
reasoning.
1. The predicate P(x,y) ::= y+x = 1 where the domain of discourse is N.
2. The predicate P(x, y) ::= y ·x = 2 where the domain of discourse is R without 0.
3. The predicate P(x, y)::= yxy = x where the domain of discourse is the set of all binary strings,
including the empty string A.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F286060ef-b6f0-4e93-baf7-6d09e677932d%2F9fb40caf-ca3c-4f09-920a-c17b3023a117%2Fmx73ptf_processed.png&w=3840&q=75)
Transcribed Image Text:The following predicate logic formulas is invalid:
Vx, 3y.P(x, y) = 3y, Vx.P(x, y)
Indicate which of the following are counter models for this formula and briefly explain your
reasoning.
1. The predicate P(x,y) ::= y+x = 1 where the domain of discourse is N.
2. The predicate P(x, y) ::= y ·x = 2 where the domain of discourse is R without 0.
3. The predicate P(x, y)::= yxy = x where the domain of discourse is the set of all binary strings,
including the empty string A.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
Step 1
According to the information given:-
We have to indicate the the predicate with logic formula on the instruction mention.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education