Predicate Logic

An extension of Propositional Logic that uses variables and quantifiers to represent and analyse Statement.

Predicate

Is a Statement that includes a variable.

  • P(x)P(x): "x is a prime number"

A predicate becomes a proposition when the variable are substituted for values.

  • P(2)P(2): "2 is a prime number" (True)

Quantifiers

Quantifiers describe how many of a thing there are.

Universal Quantifier

Symbol: \forall

Means "For all" or "Every".

Example:

x,P(x)\forall x, P(x): "For every x, x is a prime number"

Existential Quantifier

Symbol: \exists

Means "There exists" or "Some".

Example:

x,P(x)\exists x, P(x): "There exists an x such that x is a prime number"

DeMorgan's Laws for negating quantifiers

First law

The negation of "for all x, P(x)" is equivalent to "there exists an x such that not P(x)"

[(x)P(x)](x)[P(x)] \sim[(\forall x)P(x)] \equiv (\exists x)[\sim P(x)]

Second law

The negation of "there exists an x such that P(x)" is equivalent to "for all x, not P(x)"

[(x)P(x)](x)[P(x)] \sim[(\exists x)P(x)] \equiv (\forall x)[\sim P(x)]