The total count of symbols or tokens in a formula according to a chosen tokenization convention; a basic syntactic size measure that counts logical connectives, quantifiers, predicate and function symbols, variables, parentheses and sometimes punctuation.

Principle

Formula length serves as a coarse measure of syntactic complexity and resource usage; it provides a simple upper bound for parsing and encoding costs and is often used in proofs that rely on size-based induction or combinatorial counting.

Demonstration

Under a tokenization that treats each symbol and parenthesis as one token, the formula (∀x P(x) → ∃y Q(y,x)) has tokens for '(', '∀', 'x', 'P', '(', 'x', ')', '→', '∃', 'y', 'Q', '(', 'y', ',', 'x', ')', ')' so its formula length equals that token count.

Misapplication

Using formula length as a direct proxy for semantic complexity or computational cost without controlling for encoding conventions, symbol arities, or shared subexpressions is a misuse that can mislead comparisons between languages or encodings.

Consequence

When measured consistently, formula length enables combinatorial arguments, complexity estimates, and compactness bounds; controlling length is essential in encoding problems, finite-model constructions, and automated reasoning heuristics.

Reversal

The reverse viewpoint emphasizes semantic brevity: formulas of minimal length that nevertheless express complex properties show that small syntactic size does not imply low semantic or computational complexity.

Boundary

Depends on the chosen tokenization and whether shared abbreviations, defined symbols, or macro expansions are counted; it excludes semantic measures and is not invariant under different syntactic encodings or symbol-renaming conventions.

Semantic Tension

Formula length competes with measures like Kolmogorov complexity, alternation depth, and quantifier rank: a formula can be short but semantically complex or long but semantically trivial, creating tension when selecting a complexity metric.

Synthesis

Formula length is the tally of syntactic tokens under a given convention; it is a convenient, language-dependent measure of formula size used for encoding, combinatorial bounds and algorithmic resource estimates, but it must be interpreted alongside other measures.