Definition:Classes of WFFs/Plain WFF
Jump to navigation
Jump to search
Definition
A plain WFF of predicate logic is a WFF with no parameters.
Thus $\map {WFF} {\PP, \FF, \O}$ is the set of all plain WFFs with relation symbols from $\PP$ and function symbols from $\FF$.
 | This page or section has statements made on it that ought to be extracted and proved in a Theorem page. In particular: However immediate, this goes on a proof page You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by creating any appropriate Theorem pages that may be needed. To discuss this page in more detail, feel free to use the talk page. |
It is immediate that a plain WFF is a WFF with parameters from $\KK$ for all choices of $\KK$.
Sources
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability: $\S 2.3$