Predicate Logic Flashcards

1
Q

What are the keywords for Universal Quantifiers ‘∀xP(x)’ ?

A

For all/any/every/each x

This is the conjunction of the propositions over all the elements

also known as ‘AND’

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

What are the keywords for Existential Quantifiers ‘∃xP(x)’ ?

A

There exists /for some /for at least one x

This is the disjunction of the proposition over all the elements

also known as ‘OR’

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

What are the keywords for Uniqueness Quantifiers ‘∃!xP(x)’ ?

A

There exist a unique x

∃! / ∃_1 : There exist exactly one

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

[Nested Quantifiers]
∀x ∀y P(x, y)
meaning?

A

P(x, y) is true for every pair x, y.

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

[Nested Quantifiers]
∃x ∃y P(x, y)
meaning?

A

There is a pair x, y for which P(x, y) is true.

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

[Nested Quantifiers]
∃x ∀y P(x, y)
meaning?

A

There is an x for which P(x, y) is true for every y.

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

[De Morgan’s Laws for Quantifiers]
What is the equivalent proposition to
∀x ( P(x) ∧ Q(x) )

A

∀x P(x) ∧ ∀x Q(x)

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

[De Morgan’s Laws for Quantifiers]
What is the equivalent proposition to
∃x ( P(x) ∨ Q(x) )

A

∃x P(x) ∨ ∃x Q(x)

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

State in order of precedence:
Logical Operators ( ∧, ∨, ¬ )

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

[Rules of inference]
What is Modus Ponens?

A

p → q
p
———-
∴ q

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

[Rules of inference]
What is Modus Tollens?

A

¬q
p → q
————-
∴ ¬p

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

[Rules of inference]
What is Conjunction?

A

p
q
———-
∴ p∧q

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

[Rules of inference]
What is Simplification?

A

∴ p

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

[Rules of inference]
What is Addition?

A

∴ p∨q

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

[Rules of inference]
What is Hypothetical Syllogism?

A

p → q
q → r
————
∴ p → r

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

[Rules of inference]
What is Disjunctive Syllogism?

A

p∨q
¬ p
————-
∴ q

17
Q

[Rules of inference]
What is Resolution?

A

p∨q
¬ p∨r
————-
∴ q∨r

18
Q

[Rules of inference with Quantifiers]
What is Universal Instantiation?

A

∴ P(c)

19
Q

[Rules of inference with Quantifiers]
What is Universal Generalisation?

A

∴ ∀xP(x)

20
Q

[Rules of inference with Quantifiers]
What is Existential Instantiation?

A

∴ P(c) for some element of D

21
Q

[Rules of inference with Quantifiers]
What is Existential Generalisation?

A

∴ ∃xP(x)

22
Q

[Rules of inference with Quantifiers]
What is Universal Modus Ponens?

A

∀xP(x) → Q(x)
P(a) for some element of D
————
∴ Q(a)

23
Q

[Rules of inference with Quantifiers]
What is Universal Modus Tollens?

A

∀xP(x) → Q(x)
¬ Q(x) for some element of D
————
∴ ¬ P(a)