Formalizing English statements in Predicate Logic Example:

Example:
Consider the statement:

some integer between 80 and n is a multiple of x.

: every, all, for each, any
Let mult(i, x) be a predicate defined as i is a multiple of x. Then our statement can be
: some, there are, there is, at least one, for some. formalized by:
( i : Z | 80 6 i 6 n : mult(i, x) )

We could also have formalized mult(n, x) by

( m : Z | : n = m x )

Example: Negation of english statements

Examples: What is the negation of the statement All integer are even ?
All even integers are multiples of 2 may be re-phrased: for all integers x such that x is
even, x is a multiple of 2 . In our predicate logic we write this as
Wrong Answer: All integer are not even.
( x : Z | even.x : mult(x, 2) )
Correct Answer: Some integer is not even

Negation of english statements Proof by Induction

Proof by Induction:
P(1)
Proof using Predicate logic:
(n | : P(n) P(n + 1))
Not (All integers are even)
(n | : P(n))
= h Formalize in predicate calculus i
( z : Z | : even.z )
= h Using Axiom Generalised DeMorgan i Prove that n > 0 we have
Pn
1) = n2 .
i=1 (2i
( z : Z | : even.z ) basis step: Verify that the expression is true n = 1, 2, 3
= h Return to English i
Some integer is not even Inductive Step: Assume that
Pn
1) = n2 is true at n , Show that it is true for
i=1 (2i
n + 1:
Proof by Induction

Pn
Prove that n > 0 we have i=1 (2i 1) = n2 .
basis step: Verify that the expression is true n = 1, 2, 3

Pn
Inductive Step: Assume that i=1 (2i 1) = n2 is true for n, Show that it is true for
n + 1:
We have:
n
X
Pn+1
i=1 (2i 1) = (2i 1) + (2(n + 1) 1)
i=1
| {z }
| {z } Term in n+1
Hypothesis at n
2
=n +2n + 2 1
= n2 +2n + 1
= (n + 1)2