The set of axioms may be empty, a nonempty finite set, a countably infinite set, or given by axiom schemata. A [[formal grammar]] recursively defines the expressions and well-formed formulas (wffs) of the [[formal language|language]]. In addition a [[semantics]] is given which defines truth and valuations (or interpretations). It allows us to determine which wffs are valid, that is, are [[theorem]]s. | The set of axioms may be empty, a nonempty finite set, a countably infinite set, or given by axiom schemata. A [[formal grammar]] recursively defines the expressions and well-formed formulas (wffs) of the [[formal language|language]]. In addition a [[semantics]] is given which defines truth and valuations (or interpretations). It allows us to determine which wffs are valid, that is, are [[theorem]]s. |