well-formed_formula
- Snippet from Wikipedia: Well-formed formula
In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.
The abbreviation wff is pronounced "woof", or sometimes "wiff", "weff", or "whiff".
A formal language can be identified with the set of formulas in the language. A formula is a syntactic object that can be given a semantic meaning by means of an interpretation. Two key uses of formulas are in propositional logic and predicate logic.
well-formed_formula.txt · Last modified: 2024/05/01 04:06 by 127.0.0.1