Definition:Classes of WFFs/Sentence

From ProofWiki
Jump to navigation Jump to search


Let $\LL_1$ be the language of predicate logic.

A WFF is said to be a sentence if and only if it contains no free variables.

To denote particular classes of sentences, $\map {SENT} {\PP, \FF, \KK}$ and analogues may be used, similar to the notation for classes of WFFs.