**Description: **If 𝜑 is a wff, so is ¬ 𝜑 or
"not 𝜑." Part of the
recursive definition of a wff (well-formed formula). In classical logic
(which is our logic), a wff is interpreted as either true or false. So if
𝜑 is true, then ¬
𝜑 is false; if 𝜑 is false,
then
¬ 𝜑 is true. Traditionally, Greek
letters are used to represent
wffs, and we follow this convention. In propositional calculus, we define
only wffs built up from other wffs, i.e. there is no starting or
"atomic"
wff. Later, in predicate calculus, we will extend the basic wff
definition by including atomic wffs (weq 1871 and wel 1988). |