Predicate Logic Flashcards
What are the keywords for Universal Quantifiers ‘∀xP(x)’ ?
For all/any/every/each x
This is the conjunction of the propositions over all the elements
also known as ‘AND’
What are the keywords for Existential Quantifiers ‘∃xP(x)’ ?
There exists /for some /for at least one x
This is the disjunction of the proposition over all the elements
also known as ‘OR’
What are the keywords for Uniqueness Quantifiers ‘∃!xP(x)’ ?
There exist a unique x
∃! / ∃_1 : There exist exactly one
[Nested Quantifiers]
∀x ∀y P(x, y)
meaning?
P(x, y) is true for every pair x, y.
[Nested Quantifiers]
∃x ∃y P(x, y)
meaning?
There is a pair x, y for which P(x, y) is true.
[Nested Quantifiers]
∃x ∀y P(x, y)
meaning?
There is an x for which P(x, y) is true for every y.
[De Morgan’s Laws for Quantifiers]
What is the equivalent proposition to
∀x ( P(x) ∧ Q(x) )
∀x P(x) ∧ ∀x Q(x)
[De Morgan’s Laws for Quantifiers]
What is the equivalent proposition to
∃x ( P(x) ∨ Q(x) )
∃x P(x) ∨ ∃x Q(x)
State in order of precedence:
Logical Operators ( ∧, ∨, ¬ )
∀
∃
- ∀
- ∃
- Logical Operators
[Rules of inference]
What is Modus Ponens?
p → q
p
———-
∴ q
[Rules of inference]
What is Modus Tollens?
¬q
p → q
————-
∴ ¬p
[Rules of inference]
What is Conjunction?
p
q
———-
∴ p∧q
[Rules of inference]
What is Simplification?
∴ p
[Rules of inference]
What is Addition?
∴ p∨q
[Rules of inference]
What is Hypothetical Syllogism?
p → q
q → r
————
∴ p → r
[Rules of inference]
What is Disjunctive Syllogism?
p∨q
¬ p
————-
∴ q
[Rules of inference]
What is Resolution?
p∨q
¬ p∨r
————-
∴ q∨r
[Rules of inference with Quantifiers]
What is Universal Instantiation?
∴ P(c)
[Rules of inference with Quantifiers]
What is Universal Generalisation?
∴ ∀xP(x)
[Rules of inference with Quantifiers]
What is Existential Instantiation?
∴ P(c) for some element of D
[Rules of inference with Quantifiers]
What is Existential Generalisation?
∴ ∃xP(x)
[Rules of inference with Quantifiers]
What is Universal Modus Ponens?
∀xP(x) → Q(x)
P(a) for some element of D
————
∴ Q(a)
[Rules of inference with Quantifiers]
What is Universal Modus Tollens?
∀xP(x) → Q(x)
¬ Q(x) for some element of D
————
∴ ¬ P(a)