Exercise Week 2 Flashcards
- Suppose that the domain of the propositional function P (x) consists of the integers 0, 1, 2, 3, and 4.
Write out each of these propositions using disjunctions, conjunctions, and negations.
Answer Questions Below
1a(Thursday). ∃x P(x)
P(0) ∨…. ∨P(4)
1b(Thursday) .∀x P(x)
P(0)∧…∧P(4)
- 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.
Answer Questions Below
2a (Thursday). There is a student at your school who can speak Russian and who knows C++.
∃x (P(x) ∧ Q(x))
1c. ∃x ¬ P(x)
¬P(0) ∨… ∨¬P(4)
2b (Thursday). There is a student at your school who can speak Russian but who doesn’t know C++.
∃x (P(x) ∧ ¬Q(x))
2c (Thursday). Every student at your school can speak Russian or knows C++.
∀x (P(x) ∨ Q(x))
2d (Thursday). No student at your school can speak Russian or knows C++.
¬∃x (P(x) ∨ Q(x)) == ∀x (¬P(x) ∧ ¬Q(x))
3.Translate in two ways each of these statements into logical expressions using predicates, quantifiers,
and logical connectives. First, let the domain consist of the students in your class and second, let it
consist of all people.
Answer questions next
3a (Thursday). Someone in your class can speak Hindi
- ∃x(H(x))
- ∃x(C(x) ∧ H(x))
3b (Thursday). Everyone in your class is friendly
- ∀x (F(x))
- ∀x (C(x) → F(x))
3c (Thursday). There is a person in your class who was not born in California
1.∃x ¬B(x)
2.∃x(C(x) ∧ ¬B(x))
3d (Thursday). A student in your class has been in a movie
- ∃x M(x)
- ∃x (C(x) ^ M(x))
3e (Thursday). No student in your class has taken a course in logic programming
- ¬∃x P(x) or ∀x ¬P(x)
- ¬∃x (C(x) ^ P(x)) or ∀x (C(x) → ¬P(x))