0% found this document useful (0 votes)
4 views2 pages

Homework 3

The document consists of exercises related to predicates and quantifiers, including translations of logical statements into English and expressions using logical connectives. It also involves determining truth values of statements and finding domains for which certain statements are true or false. Additionally, it requires expressing various logical propositions using predicates and quantifiers.

Uploaded by

harisamser27
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views2 pages

Homework 3

The document consists of exercises related to predicates and quantifiers, including translations of logical statements into English and expressions using logical connectives. It also involves determining truth values of statements and finding domains for which certain statements are true or false. Additionally, it requires expressing various logical propositions using predicates and quantifiers.

Uploaded by

harisamser27
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Homework 3- Predicates and Quantifiers

1. Translate these statements into English, where


C(x) is “x is a comedian” and F(x) is “x is funny” and the domain

a) ∀x(C(x)→ F(x))
consists of all people.

b) ∀x(C(x)∧F(x))
c) ∃x(C(x)→ F(x))
d) ∃x(C(x)∧F(x))

2. Let P(x) be the statement “x can speak Russian” and let Q(x) be
the statement “x knows the computer language C++.”
Express each of these sentences in terms of P(x) , Q(x),
quantifiers, and logical connectives. The domain for quantifiers
consists of all students at your school.
a) There is a student at your school who can speak Russian and
who knows C++.
b) There is a student at your school who can speak Russian but
who doesn’t know C++.
c) Every student at your school either can speak Russian or knows
C++.
d) No student at your school can speak Russian or knows C++.
3. Determine the truth value of each of these statements if the

a) ∀n(n2 ≥0)
domain for all variables consists of all integers.

b) ∃n(n2 =2)
c) ∀n(n2 ≥ n)
d) ∃n(n2 < 0)

4. For each of these statements find a domain for which the


statement is true and a domain for which the statement is false.
a) Everyone is studying discrete mathematics.
b) Everyone is older than 21 years.
c) Every two people have the same mother.
d) No two different people have the same grandmother

5. Express each of these statements using logical operators,


predicates, and quantifiers.
a) Some propositions are tautologies.
b) The negation of a contradiction is a tautology.
c) The disjunction of two contingencies can be a tautology.
d) The conjunction of two tautologies is a tautology.

You might also like