Predicates & Quantifiers Flashcards

1
Q

When is ∀xP(x) true?

A

When P(x) is true for every x

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

When is ∀xP(x) false?

A

When there is an x for which P(x) is false.

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

What is ∃xP(x)?

A

The existential quantifier.

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

When is ∃xP(x) true?

A

When there is an x for which P(x) is true.

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

When is ∃xP(x) false?

A

When P(x) is false for every x.

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

P(x1) ∧ P(x2) ∧ … ∧ P(xn)

Is equivalent to which quantifier?

A

The universal quantifier, when all elements in the domain can be listed.

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

P(x1) ∨ P(x2) ∨ … ∨ P(xn)

Is equivalent to which quantifier?

A

The existential quantifier, when all elements in the domain can be listed.

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

What is ∃!xP(x)?

A

The uniqueness quantifier.

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

When is ∃!xP(x) true?

A

When there is exactly one and only one solution.

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

The restriction of a universal quantifier is the same as what?

A

As the universal quantification of a conditional statement.
E.g.
∀x

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

What takes precedence for Quantifiers and other logical operations?

A

The order of precedence is
∀ ∃ before every other logical operation.

Then the usual order of precedence of logical operators.

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

What is ∀x(P(x) ∧ Q(x)) equivalent to?

A

∀xP(x) ∧ ∀xQ(x)

In other words, universal quantifiers distribute over a conjunction.

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

What can existential quantifiers distribute over?

A

A disjunction.

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

What can’t you distribute either existential or universal quantifiers over?

A

Universal: can’t be distributed over a disjunction.

Existential: can’t be distributed over a conjunction.

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

What is ∀xP(x)?

A

The universal quantifier

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

De Morgan’s Laws for Quantifiers

A

¬∃xP(x) ≡ ∀x¬P(x)
True when for every x, P(x) is false.
False when there is an x for which P(x) is true.

¬∀xP(x) ≡ ∃x¬P(x)
True when there is an x for which P(x) is false.
False when P(x) is true for every x.