NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  wn Unicode version

Syntax Definition wn 3
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 1643 and wel 1711).
Ref Expression
Ref Expression

This syntax is primitive. The first axiom using it is ax-3 8.

Colors of variables: wff setvar class
  Copyright terms: Public domain W3C validator