Predicate Logic

17. Logical consequence

Lecture
Validity
 A first order formula of vocabulary L is
valid if it is satisfied by every
assignment in every structure for L.
 A valid formula expresses a general
logical truth, something which is always
true whatever is the meaning of the
predicate and constant symbols of the
formula.

Last
Jouko Väänänen: Predicate logic viewed
Examples

 Tautologies are valid

 (A ∨ B) ↔ (B ∨ A)
 A ∨ ¬A
 ¬(A ∨ B) ↔ (¬A ∧ ¬B)
 ¬(A ∧ B) ↔ (¬A ∨ ¬B)
 (A → B) ↔ (¬A ∨ B)
 ∀xP0(x) ∨ ¬∀xP0(x)

Last
Jouko Väänänen: Predicate logic viewed
Examples
 Valid equations
 x=x
 x=y → y=x
 (x=y ∧ y=z) → x=z
 Valid quantifier statements
 ∀xPn(x)→Pn(y)
 Pn(y)→∃xPn(x)
 ∀xPn(x)→ ∀yPn(y)

Last
Jouko Väänänen: Predicate logic viewed
Logical consequence
 Suppose A and B are first order
formulas of a vocabulary L. We say that
B is a logical consequence A if in any
model M, every assignment that
satisfies A satisfies B.
 Equivalently, A→B is valid.
 Note: There is no mechanical method
for deciding logic consequence. One
has to be creative.

Last
Jouko Väänänen: Predicate logic viewed
Equivalence
 Suppose A and B are first order
formulas of a vocabulary L. We say that
A and B are equivalent if they are
logical consequences of each other.
 Equivalently, A↔B is valid.

Last
Jouko Väänänen: Predicate logic viewed
Some equivalences
Formula Equivalent formula
¬∃xA ∀x¬A
¬∀xA ∃x¬A
∀x(A ∧ B) ∀xA ∧ ∀xB
∃x(A ∨ B) ∃xA ∨ ∃xB
∃x∃yA ∃y∃xA
∀x∀yA ∀y∀xA

Last
Jouko Väänänen: Predicate logic viewed