Exercise Week 2 Flashcards

1
Q
  1. 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.
A

Answer Questions Below

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

1a(Thursday). ∃x P(x)

A

P(0) ∨…. ∨P(4)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

1b(Thursday) .∀x P(x)

A

P(0)∧…∧P(4)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  1. 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

Answer Questions Below

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

2a (Thursday). There is a student at your school who can speak Russian and who knows C++.

A

∃x (P(x) ∧ Q(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

1c. ∃x ¬ P(x)

A

¬P(0) ∨… ∨¬P(4)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

2b (Thursday). There is a student at your school who can speak Russian but who doesn’t know C++.

A

∃x (P(x) ∧ ¬Q(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

2c (Thursday). Every student at your school can speak Russian or knows C++.

A

∀x (P(x) ∨ Q(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

2d (Thursday). No student at your school can speak Russian or knows C++.

A

¬∃x (P(x) ∨ Q(x)) == ∀x (¬P(x) ∧ ¬Q(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

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.

A

Answer questions next

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

3a (Thursday). Someone in your class can speak Hindi

A
  1. ∃x(H(x))
  2. ∃x(C(x) ∧ H(x))
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

3b (Thursday). Everyone in your class is friendly

A
  1. ∀x (F(x))
  2. ∀x (C(x) → F(x))
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

3c (Thursday). There is a person in your class who was not born in California

A

1.∃x ¬B(x)
2.∃x(C(x) ∧ ¬B(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

3d (Thursday). A student in your class has been in a movie

A
  1. ∃x M(x)
  2. ∃x (C(x) ^ M(x))
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

3e (Thursday). No student in your class has taken a course in logic programming

A
  1. ¬∃x P(x) or ∀x ¬P(x)
  2. ¬∃x (C(x) ^ P(x)) or ∀x (C(x) → ¬P(x))
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. Translate each of these statements into logical expressions using predicates, quantifiers, and logical
    connectives.
A

Answer Questions next

17
Q

4a (Thursday). No one is perfect

A

¬ ∃x P(x) = ∀x ¬ P(x)

18
Q

4b (Thursday). Not everyone is perfect

A

c ∀x P(x) = ∃x ¬ P(x)

19
Q

4c (Thursday). All your friends are perfect.

A

∀x (F(x) → P(x))

20
Q

4d (Thursday). At least one of your friends is perfect.

A

∃x (F(x) ^ P(x))

21
Q

4e (Thursday). Everyone is your friend and is perfect

A

∀x (F(x) ^ P(x))

22
Q

4f (Thursday). Not everybody is your friend or someone is
not perfect.

A

¬ ∀x F(x) ∨ ∃x ¬ P(x)

23
Q
  1. Express each of these statements using quantifiers. Then form the negation of the statement, so that no negation is to the left of a quantifier. Next, express the negation in simple English. (Do not simply use the phrase “It is not the case that.”) Domain: All Creatures
A

Answer next questions

24
Q

5a. Some old dogs can learn new tricks.

A
  1. ∃x (D(x) ^ T(x))
  2. ∀x ( D(x) → ¬ T(x))
  3. For all creatures. if you are an old dog you cannot learn new tricks.
25
Q

5b. No rabbit knows calculus.

A
  1. ¬ ∃x (R(x) ^ C(x))
    2.∃x (R(x) ^ C(x))
26
Q

5c. Every bird can fly.

A
  1. ∀x (B(x) → F(x))
  2. ∃x( B(x) ^ ¬ F(x))
27
Q

5d. There is no dog that can talk.

A
  1. ¬ ∃x ( D(x) ^ T(x))
  2. ∃x ( D(x) ^ T(x))
28
Q

5e. There is no one in this class who knows French and Russian

A
  1. ¬∃x(C(x) ^ (F(x) ^ R(x)))
  2. ∃x(C(x) ^ (F(x) ^ R(x)))
29
Q
  1. Express the negation of each of these statements in terms of quantifiers without using the negation
    symbol.
A

Answer Questions Below

30
Q

6a.¬∀x(x > 1)

A

∃x( x <= 1)

31
Q

6b.

A

∃x( x > 1)

32
Q

6c.

A

∀x( x < 4)

33
Q

6d.

A

∀x( x >= 0)

34
Q

6e.

A

∃x((x >= 1) ^ (x <= 2))

35
Q

6f

A

∀x(( x >= 4) ^ (x <= 7))

36
Q

Bonus: ¬∀x(1 <= x < 2)

A

∃x ¬( (x >= 1) ^ (x < 2))

37
Q
A