Formation rule¶
A syntactic rule that recursively determines which symbol strings or expressions are well formed in a formal language, independently of their meaning or truth.
Core Idea¶
Formation rules specify how legitimate expressions of a formal language are built from primitive symbols and earlier well-formed expressions. Inductive clauses generate the smallest set closed under declared constructors, and parsing verifies that a string has a derivation in that grammar. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of logic. It is inductive boundary between grammatical and malformed symbolic expressions. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that well-formedness depends only on the formal syntax and category rules, not on semantic interpretation fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.
Scope of Application¶
Formation rule belongs to logic and is useful where the analyst can specify a formal alphabet, primitive symbols, expression categories, base clauses, recursive constructors, parse trees, metavariables and a well-formedness judgment, then evaluate well-formedness depends only on the formal syntax and category rules, not on semantic interpretation. The scope is broad within that domain but bounded by the need for well-formedness depends only on the formal syntax and category rules, not on semantic interpretation. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making well-formedness depends only on the formal syntax and category rules, not on semantic interpretation the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Formation rule can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Formation rule. Formation rule compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: a formal alphabet, primitive symbols, expression categories, base clauses, recursive constructors, parse trees, metavariables and a well-formedness judgment. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express well-formedness depends only on the formal syntax and category rules, not on semantic interpretation independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of logic because they reuse a formal alphabet, primitive symbols, expression categories, base clauses, recursive constructors, parse trees, metavariables and a well-formedness judgment, Inductive clauses generate the smallest set closed under declared constructors, and parsing verifies that a string has a derivation in that grammar., and type the carrier, state every parameter and convention in the definition, test that well-formedness depends only on the formal syntax and category rules, not on semantic interpretation, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Formation rule Domain-specific
Parents (1) — more general patterns this builds on
-
Formation rule is a kind of Constraint Prime
The proposed strict upward parent is
prime:constraint.
Hierarchy path (1) — routes to 1 parentless root
- Formation rule → Constraint
Neighborhood in Abstraction Space¶
Formation rule sits in a crowded region of the domain-specific corpus (16th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Syntax, Rewriting & Declarative Form (41 abstractions)
Nearest neighbors
- Syntax (logic) — 0.95
- Type constructor — 0.92
- Logical connective — 0.92
- Interpretation (logic) — 0.91
- Logic form — 0.91
Computed from structural-signature embeddings · 2026-09-08