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, constructed following the defined grammar of a formal language.
Core Idea¶
A well-formed formula (WFF) is a finite symbolic expression admitted by the formation rules of a specified formal language. It is a syntactic object: being well formed means that the expression has the grammatical structure required by the language, not that it is true, valid, satisfiable, meaningful under an interpretation, or provable in a deductive system. The language fixes an alphabet and a grammar. In propositional logic, propositional variables supply the atomic formulas, while recursive clauses form new formulas with negation and binary connectives.
Scope of Application¶
A well-formed formula applies wherever an explicitly specified formal language admits finite symbol sequences through declared atomic cases and recursive formula-formation rules. Its habitats are literal only relative to the language's alphabet, signature, arities, binding, and notation; semantic truth, satisfiability, and proof status begin after this syntactic admission test.
- Propositional logic — propositional variables supply atomic formulas, while negation and binary connective clauses recursively generate compound WFFs.
- First-order predicate logic — terms are generated first, predicates and equality form atomic formulas, and connectives plus quantifiers generate formulas under a declared signature and arities.
- Modal and other formal logics — additional operators and formation clauses define their own formula classes without changing the grammar-relative admission principle.
- Formal-language and grammar specification — Backus–Naur or comparable grammars state the constructors from which a parser can derive exactly the admitted expressions.
Clarity¶
Well-formed formula separates grammatical admissibility from every semantic and deductive property that may later be asked of an expression. A formula can be well formed yet false under an interpretation, unsatisfiable, invalid, or unprovable; it can also be well formed before any interpretation is supplied. Conversely, a string that suggests an intelligible proposition does not qualify if it cannot be generated by the formal language’s formation rules.
Manages Complexity¶
Formal expressions proliferate combinatorially even over a small alphabet. Well-formedness reduces that unbounded string space to the least class generated by a finite grammar: declared atomic cases plus recursively permitted constructors. A parser or logician therefore tracks the signature, symbol arities, formation clauses, and parse tree rather than comparing each candidate string with an enumerated list of acceptable formulas.
Abstract Reasoning¶
Well-formedness licenses recursive parsing and induction. To classify a string, a logician reasons from declared alphabet, signature, arities, binding convention, and formation rules → parse tree or precise point of failure. Leaves must be licensed atomic formulas or terms; each internal node must apply an allowed connective, quantifier, function, or predicate with the required number and kind of constituents.
Knowledge Transfer¶
Within formal logic, the well-formed-formula concept transfers literally across propositional, predicate, modal, and other formal languages when each language supplies an alphabet, arities, base expressions, and recursive formation rules. The cargo that carries intact is finite symbolic expression, syntactic derivation, parse structure, and the smallest class closed under the declared constructors. Diagnostics transfer by parsing from the grammar, checking symbol roles and arities, and separating formation from interpretation, satisfiability, validity, or proof.
Relationships to Other Abstractions¶
Current abstraction Well-Formed Formula Domain-specific
Parents (1) — more general patterns this builds on
-
Well-Formed Formula presupposes Formal System Prime
Well-Formed Formula presupposes Formal System: the parent's defining role is necessary to the child's frozen mechanism or criterion.
Hierarchy paths (2) — routes to 2 parentless roots
- Well-Formed Formula → Formal System → Formalization → Representation → Abstraction
- Well-Formed Formula → Formal System → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Well-Formed Formula sits in a crowded region of the domain-specific corpus (34th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Type Systems & Functional Constructs (18 abstractions)
Nearest neighbors
- Propositional formula — 0.90
- Noncontracting Grammar — 0.88
- Formal Theory — 0.88
- Conjunctive grammar — 0.88
- Abstract Syntax Tree — 0.87
Computed from structural-signature embeddings · 2026-10-08