1.Previous
3.Next

or WFFs) is inductively defined by the following rules:
# Predicate symbols. If P is an n-ary predicate symbol and t₁, ..., t_n are terms then P(t₁,...,t_n) is a formula.
#* Equality. If the equality symbol is considered part of logic, and t₁ and t₂ are terms, then t₁ = t₂ is a formula.
# Negation. If is a formula, then is a formula.
# Binary connectives. If and are formulas, then ()

1.Previous
3.Next