Which of the following properties is/are true in context of well formed formula (WFF)?
Well-formed formula is a finite sequence of symbols from a given alphabet that is part of a formal language. A formal language can be identified with the set of formulas in the language.
All are true in context of well-formed formula (WFF).
Each letter is a term.
If x and y are terms, then x = y is a formula.
If P is a formula, then 7P is a formula.