Definition:Classes of WFFs/Sentence

Definition
Let $\mathcal L_1$ be the language of predicate logic. A WFF is said to be a sentence it contains no free variables.

To denote particular classes of sentences, $SENT \left({\mathcal P, \mathcal F, \mathcal K}\right)$ and analogues may be used, similar to the notation for classes of WFFs.