filmov
tv
Discrete Structures, Lec#23, Translating from English into Logical Expressions

Показать описание
Express the statement “Every student in this class has a calculator” using predicates and quantifiers.
If the domain consists of all people, express the statement “Every student in this class has a calculator” using predicates and quantifiers.
Express the statement “Some student in this class has visited Murree” using predicates and quantifiers.
Express the statement “Every student in this class has visited either Murree or Naran” using predicates and quantifiers.
Consider
P(x) : x can speak Russian
Q(x) : x knows C++
Convert the following statements into symbolic form by using quantifiers and predicates.
First take universe of discourse = {students in your school}
Then take universe of discourse = {all people}
(a) There is a student in your school who can speak Russian and who knows C++.
(b) No student in your school either can speak Russian or knows C++.
(c) Not all students in your school can speak Russian.
(d) There is a student in your school who can speak Russian but do not know C++.
(e) Every student in your school knows C++.
Discrete Structures, CC-111, for BS Computer Science, University of the Punjab
Discrete Mathematics, MATH-231, for BS Information Technology, University of the Punjab
Discrete Mathematics, MATH-105, for BS Mathematics, University of the Punjab
Discrete Mathematics by Z.R. Bhatti
If the domain consists of all people, express the statement “Every student in this class has a calculator” using predicates and quantifiers.
Express the statement “Some student in this class has visited Murree” using predicates and quantifiers.
Express the statement “Every student in this class has visited either Murree or Naran” using predicates and quantifiers.
Consider
P(x) : x can speak Russian
Q(x) : x knows C++
Convert the following statements into symbolic form by using quantifiers and predicates.
First take universe of discourse = {students in your school}
Then take universe of discourse = {all people}
(a) There is a student in your school who can speak Russian and who knows C++.
(b) No student in your school either can speak Russian or knows C++.
(c) Not all students in your school can speak Russian.
(d) There is a student in your school who can speak Russian but do not know C++.
(e) Every student in your school knows C++.
Discrete Structures, CC-111, for BS Computer Science, University of the Punjab
Discrete Mathematics, MATH-231, for BS Information Technology, University of the Punjab
Discrete Mathematics, MATH-105, for BS Mathematics, University of the Punjab
Discrete Mathematics by Z.R. Bhatti
Комментарии