You are on page 1of 1

Handout 4

Natural Deduction Rules for Predicate Logic


EECS 203
Fall 2019

The Natural Deduction rules for predicate calculus consist of the 12 introduction and
elimination rules for propositional calculus in Handout 2 (with formulas rather than
propositional variables) and the following four rules. There is an introduction rule for
each quantifier (∀, ∃) and an elimination rule for each quantifier. Handout 3 contains
examples.
x0
..
.
P (x0 ) ∀xP (x)
(∀-intro) (∀-elim)
∀xP (x) P (t)

x0 P (x0 )
..
.
P (t) ∃xP (x) q
(∃-intro) (∃-elim)
∃xP (x) q

Note that like propositions in previous rules, these predicates can be as complex
as needed. For example, if we let P (x) = Q(x) ∧ ∀yR(x, y), then the following is a
valid application of ∃-intro:
Q(4) ∧ ∀yR(4, y)
∃x(Q(x) ∧ ∀yR(x, y))

You might also like