Definition
Well-formed Formula (Propositional Logic)
In propositional logic, a well-formed propositional formula is a syntactically correct propositional formula generated by the following rules:
- Every atom is a propositional formula.
and are propositional formulas. - If
are propositional formulas with , then and are propositional formulas. - If
is a propositional formula, then is a propositional formula. - If
and are propositional formulas, then and are propositional formulas. - Nothing else is a well-formed propositional formula.
Here,
, , , , and are connectives, namely conjunction, disjunction, negation, implication, and equivalence. The symbols and are propositional constants.
Examples
Examples
The following are well-formed propositional formulas:
The following are not well-formed: