The finite or countable set of basic symbols from which well-formed expressions of a formal language are constructed.

Principle

An alphabet provides the primitive tokens and determines which sequences may be parsed into syntactic objects according to formation rules; it is the syntactic foundation distinct from semantics or grammar rules that operate over those tokens.

Demonstration

In propositional logic an alphabet can be {p, q, r, ¬, ∧, ∨, (, )}; in a first-order signature the alphabet includes predicate and function symbols, variable symbols, parentheses and logical connectives.

Misapplication

Treating semantic values, types, or metavariables as part of the alphabet (for example, conflating truth-values or evaluation results with symbol tokens) falsely mixes object-level syntax with interpretation.

Consequence

With a fixed alphabet one can define well-formed formulas, tokenization, and parsing; algorithms for syntactic manipulation (tokenizers, parsers, finite automata) depend directly on the alphabet's size and properties.

Reversal

Instead of starting from a primitive set of symbols, imagine defining expressions only by semantic objects and deriving symbolic names—this inverts the syntactic-first viewpoint and corresponds to working at the semantic or model level.

Boundary

The alphabet excludes meta-language punctuation, semantic interpretations, and context-dependent layout; it is typically finite or countable and does not include arbitrarily structured subexpressions or meanings.

Semantic Tension

Alphabet vs vocabulary/signature: an alphabet emphasizes raw symbols and token classes, whereas a signature or vocabulary emphasizes labeled function and predicate symbols together with arities and intended roles.

Synthesis

An alphabet is the minimal inventory of symbol tokens from which a formal language's syntax is built; it underlies parsing and syntactic analysis while remaining separate from grammatical, semantic, or pragmatic layers.