(2) Let P (x, y) : x plays in y." A(x): x is athletic." S(x) :x is smart." E(y) : y is in English league." F (y) : y is famous." Assume the domain of x is all players and the domain of y is all football teams. Answer the following questions. (a) Write the symbolic for: Some smart and athletic players play in some English league teams (b) Write the English for: 3y A(MohamedSalah) ^ E(y) ^ P (MohamedSalah, y). (c) Rewrite the statement starting with "Some... ": Not all smart players play in some famous teams

(2) Let P (x, y) : x plays in y." A(x): x is athletic." S(x) :x is smart." E(y) : y is in English league." F (y) : y is famous." Assume the domain of x is all players and the domain of y is all football teams. Answer the following questions. (a) Write the symbolic for: Some smart and athletic players play in some English league teams (b) Write the English for: 3y A(MohamedSalah) ^ E(y) ^ P (MohamedSalah, y). (c) Rewrite the statement starting with "Some... ": Not all smart players play in some famous teams

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

See similar textbooks

Similar questions

Let I(x) be the statement "x has an Internet connection" and C(x, y) be the statement "x and y have chatted over the Internet," where the domain for the variables x and y consists of all students in your class. Use quantifiers to express each of these statements. i) Everyone in your class with an Internet connection has chatted over the Internet with at least one other student in your class. ii) Someone in your class has an Internet connection but has not chatted with anyone else in your class. Express each of these system specification using predicates, quantifiers and logical operators if necessary. i) There are at least two paths connecting every two distinct end points of the network. ii) No one knows the password of every user except for the system administrator who knows all password.
d) Let P(x), Q(x), and R(x) be the statements "x is a professor," "x is ignorant," and "x is vain," respectively. Express each of these statements in symbolic form using quantifiers; logical connectives; and P(x), Q(x), and R(x), where the domain consists of all people. i. No professors are ignorant. ii. All ignorant people are vain. iii. No professors are vain.
Let S(x) = "x is a student at Leeward Community College"; F(x) = "x is a faculty member at Leeward Community College", and E(x,y) "x has eaten y at the Leeward Community College cafeteria" where the universe of discourse for x is all the people who are associated with Leeward Community College, and the universe for discourse for y is the menu items in the Leeward Community College cafeteria. a. Translate into English: ³x y (S(x) -> E(x, y)) b. Translate into symbols: Every Leeward CC faculty member has eaten at least one menu item at the Leeward Community College cafeteria.
6. Given, A = p A (p V q) and B = p v (p A q). State whether A = B or not. 7. Let P(x), Q(x), and R(x) be the statements. "x is a student," “x is smart," and "x is shy," respectively. Express each of these statements using quantifiers; logical connectives; and P(x), Q(x), and R(x), where the domain consists of all people. a. Some students are shy. b. All smart people are not shy.
QUESTION 11 Consider the following statements: T(x, y): "x eats y". A(x): "x is wise". S(x): "x is hungry". F(y): "y is fat". H(y): "y is healthy". The domain of x is the set of all people and the domain of y is the set of all food. Select the symbolic of the following sentence (one or more answers): "All healthy food are eaten by all wise people" None of all proposed answers Vx Vy T(x,у) — (х) V -Н(у) Vx Vy ¬T(x,y) →A (x) V H (y) Vx Vy -T(x,y) v ¬A (x) V ¬H (y) Vx Vy -T(x,y) → ¬A (x) V ¬H (y)
Click and drag the appropriate word, symbol, or phrase into the most appropriate blank. Let P(x) be the statement "x can speak Russian" and let Q(x) be the statement "x knows the computer language C+t." Consider the statement, "Every student at your school either can speak Russian, or knows C+." This statement is k(n) beginning of the symbolic statement is statement, because of the word, "every." So, the appropriate quantifier to be applied at the .We want this symbol to act on x, representing a student at your school. The universal statement may be rewritten for clarity's sake as, "Every student at your school speaks Russian or every student at your school knows C++." The phrases, "student at your school speaks Russian" and "student at your school knows C++" are directly symbolized by respectively. Finally, the word "or" requires the statement to employ the . Hence, the completed quantified statement is Q(X) and P(x) P(x) and Q(x) universal VX(P(x)vQ(x)) 3X(P(X)AQ(x)) conditional…
1. Suppose that a bank only permits passwords that are strings from the alphabets = {a,b.c, d, 1, 2, 3, 4). The passwords follow the rules (a) The length can be 5 or more. (b) The first alphabet must be from {a,b,c,d}. (c) The last two alphabets must be from {1,2,3,4} Give a regular expression for this language.
: Let Q(x, y) be the statement “Student x has been a contestant on quiz show y”.Express each of the following sentences in terms of Q(x, y), quantifiers, and logical connectives,where the domain for x consists of all students at your school and the domain for y consists of allquiz shows on television.1. There is a student at your school who has been a contestant on a television quiz show.2. No student at your school has ever been a contestant on a television quiz show.3. There is a student at your school who has been a contestant on Jeopardy and on Wheel ofFortune.4. Every television quiz show has had a student from your school as a contestant.5. At least two students from your school have been contestants on Jeopardy.
Let l(x) be "x has an internet conection" and C(x, y) be "x and y have chatted over the internet". Assume the domain is all students in a class. Express the following using quantifiers. 1. Jerry does not have an internet connection 2. Exactly one student in the class has an internet connection 3. Someone in your class has an internet connection but has not chatted with anyone else in the class.
QUESTION 10 Consider the following statements: T(x, y): "x eats y". A(x): "x is wise". S(x): "x is hungry". F(y): "y is fat". H(y): "y is healthy". The domain of x is the set of all people and the domain of y is the set of all food Select the negation of the following sentence (one or more answers): "All wise people do not eat some healthy food" "Some wise people eat all healthy food" "All wise people eat some healthy food" "Some wise people do not eat all healthy food" "Some wise people eat some healthy food" None of the proposed answers
Let P(X) = “x ate lunch at Jollibee” and S(x) = “x is a Leeward CC Student” 5. Assume the universe of discourse is all people. Translate into symbols, “All Leeward Community College students ate lunch at Jollibee.” 6. Using symbols, express the negation of number 5
QUESTION 5 Let F(x,y): "x is friend with y", N(x): "x is funny", W(x): "x is wise", R(x): "x is fair". The domain for x and y is the set of all persons. Write the negation in English starting by "Some .. " of : Vx 3y w(x) →R(y) ^ F(x,y)