From Signs to Formal Structure

What this lesson covers

Why and how Peirce’s semiotic theory invites mathematical formalization, which mathematical structures correspond to which semiotic concepts, and what is gained by making the correspondence precise.

Prerequisites

Signs and Interpretants, Semiosis and Sign Processes. Familiarity with Heyting algebras, closure operators and fixed points, and typed lambda calculus is helpful but not required — the lesson motivates why those structures appear.

---

Why formalize signs?

Peirce’s semiotics is already structured. The sign relation is triadic. Signs fall into classifications (icon/index/symbol, qualisign/sinsign/legisign, rheme/dicisign/argument). Semiosis is iterative — interpretants become signs for further interpretation. These are not vague observations but descriptions of a structured process. The question is whether that structure can be made mathematically precise, and what precision buys.

Three things motivate formalization:

Compositionality. Signs combine. Words combine into sentences, sentences into arguments, arguments into theories. Any account of sign systems needs to explain how the meaning of a combination relates to the meanings of its parts. Mathematics provides tools for this: algebras describe how operations compose, and type theory describes how compositions respect their types (Pierce, 2002).

Iterative closure. Semiosis does not stop. Every interpretant is itself a sign. Any formal model of semiosis must capture this self-referential character — the process generates further structure from existing structure until it stabilizes (if it does). This is exactly what closure operators do: they take a structure and extend it until it satisfies a condition, and the Knaster-Tarski fixed-point theorem guarantees that a stable state exists (Tarski, 1955).

Constructive reasoning. Not all claims about signs can be decided. A sign may have multiple possible interpretants; a sign process may not have a unique outcome. Classical logic, which assumes every proposition is either true or false, is too strong for reasoning about meaning. Intuitionistic logic, which requires a construction to assert a claim, fits better — and its algebraic semantics is the Heyting algebra (Troelstra & van Dalen, 1988).

Signs as a partially ordered domain

The first step is to give the space of signs a mathematical structure. Signs are not just a set — they stand in relations of generality and specificity. A general sign (like the concept “animal”) encompasses more specific signs (like “dog” or “eagle”). This is a partial order: a relation that is reflexive, antisymmetric, and transitive.

But signs also combine. Given two signs, you can form their conjunction (a sign that means both), their disjunction (a sign that means one or the other), and their implication (a sign that means “if this, then that”). These operations make the space of signs a lattice — and if the lattice is complete (meets and joins exist for arbitrary collections, not just pairs) and the implication operation satisfies the right adjointness condition, the result is a complete Heyting algebra.

This is not an arbitrary choice. The Heyting algebra structure ensures that the logic of signs is intuitionistic: you can reason about signs constructively, without assuming that every sign either means something definite or doesn’t. The implication operation ($a\Rightarrow b$) captures the logical relationship “if sign $a$, then sign $b$,” and the lattice order captures the relationship “sign $a$ is at least as informative as sign $b$” (Davey & Priestley, 2002).

Modal stability and the closure operator $j$

Not all signs are equally settled. Some sign relations are stable — established by convention, repeated use, institutional authority. Others are tentative, context-dependent, or in flux. Peirce’s distinction between immediate, dynamical, and final interpretants reflects this: the immediate interpretant is what the sign is designed to mean (stable), the dynamical is what it actually produces in a given context (variable), and the final is the ideal limit (an aspiration).

A modal closure operator $j$ on the Heyting algebra formalizes this. For any sign $a$, the value $j(a)$ is the “stabilized” version — the meaning that persists under the stabilizing process. The fixed points of $j$ (where $j(a)=a$) form the modal fragment: the space of stable meanings. This fragment is itself a Heyting algebra, inheriting the logical structure of the whole space.

The properties of $j$ — monotone, extensive, idempotent, join-preserving — correspond to natural requirements on stabilization: it doesn’t reduce information (extensive), it respects relative generality (monotone), applying it twice is the same as applying it once (idempotent), and stabilizing a combination is the combination of the stabilized parts (join-preserving).

The trace comonad $G$

Signs carry history. An interpretant doesn’t appear from nowhere — it is produced by a particular sign in a particular context, and that provenance matters. Two interpretants might have the same content but different histories, and that difference can affect future interpretation.

A comonad $G$ on the Heyting algebra formalizes this. For any sign $a$, the value $G(a)$ is the sign “together with its interpretive history” — the trace of how it was produced. The counit ($G(a)\le a$: the trace of $a$ is at most as informative as $a$ itself) and comultiplication ($G(a)\le G(G(a))$: you can trace the trace) satisfy associativity and identity laws that ensure the tracing operation is coherent.

The requirement that $G$ also preserves the Heyting algebra structure (it commutes with meets, joins, and implication) means that tracing respects the logical structure of signs — you don’t lose logical relationships by tracking provenance.

Syntactic operators and the typed lambda calculus

Signs combine according to rules. Words in a language combine according to grammar; symbols in a formal system combine according to formation rules; visual signs in a diagram combine according to spatial conventions. These rules form the syntax of the sign system.

The typed lambda calculus provides a general-purpose language for describing such combinatory rules. Each syntactic operation is a function that takes signs and produces new signs, and the type system ensures that operations respect the kinds of signs they operate on. The Curry-Howard correspondence guarantees that well-typed syntactic operations correspond to valid logical inferences — syntax and logic are two faces of the same structure (Sørensen & Urzyczyn, 2006).

An interpretation maps each syntactic operator to a semantic function on the Heyting algebra. The interpretation must respect all the structure: it preserves the lattice order, the modal operator, the trace comonad, and the fragment structure. This ensures that what you can say (syntax) and what you can mean (semantics) are coherent.

Closure, fusion, and the least fixed point

Now the pieces come together. Start with primitive data — a Heyting algebra with modal and trace operators, a set of syntactic primitives, and an interpretation. Three closure operators build the semiotic universe from this base:

• Semantic closure (${\mathcal{S}}_{\mathrm{sem}}$): extend the space of signs by applying operators, closing under Heyting operations, and including fixed points of admissible processes. This corresponds to semiosis: signs generate interpretants, which are themselves signs, generating further structure.
• Syntactic closure (${\mathcal{S}}_{\mathrm{syn}}$): extend the set of operators by closing under composition, lambda-definability, and semantic justification. If an operator behaves like an existing operator on every finite piece of the sign space, it earns a name. This corresponds to the growth of a sign system’s expressive power.
• Fusion (${\mathcal{S}}_{\mathrm{fus}}$): identify operators that agree on all fragments and name behaviors that are already available. This enforces coherence: syntax and semantics must tell the same story.

The composite $\mathcal{S}={\mathcal{S}}_{\mathrm{fus}}\circ {\mathcal{S}}_{\mathrm{syn}}\circ {\mathcal{S}}_{\mathrm{sem}}$ is monotone and inflationary. By the Knaster-Tarski fixed-point theorem, it has a least fixed point. This least fixed point is the semiotic universe: the smallest structure that is closed under all three operations — the minimal self-sustaining sign system built from the given primitives (Tarski, 1955).

What the formalization provides

The semiotic universe is not just a mathematical curiosity. It gives precise answers to questions that Peirce’s framework raises but cannot resolve informally:

• When does semiosis stabilize? At the least fixed point of the composite closure operator. The existence of this fixed point is guaranteed; its construction is explicit.
• What does it mean for syntax and semantics to be coherent? Fusion-saturation: every syntactic distinction corresponds to a semantic distinction, and every available semantic behavior has a syntactic name.
• What is the minimal sign system? The initial semiotic structure — the one that embeds into every semiotic structure over the same primitives. It contains exactly what the primitives and the closure operations generate, and nothing more.
• How do different sign systems relate? Through structure-preserving morphisms. The semiotic universe is initial in the 2-category of semiotic structures, which means there is a unique (up to fragmentwise extensional equality) morphism from it into any other semiotic structure over the same data.

Applications

This bridging perspective — from Peircean semiotics to algebraic structure — is what the formal specification of the semiotic universe builds on. The curriculum lessons on the semantic domain, syntactic operators, and fragments and fusion develop each component in mathematical detail. The connection back to sign theory ensures that the mathematics remains accountable to the semiotic phenomena it formalizes.

Davey, B. A., & Priestley, H. A. (2002). Introduction to Lattices and Order (2nd ed.). Cambridge University Press.

Pierce, B. C. (2002). Types and Programming Languages. MIT Press.

Sørensen, M. H., & Urzyczyn, P. (2006). Lectures on the Curry-Howard Isomorphism. Elsevier.

Tarski, A. (1955). A Lattice-Theoretical Fixpoint Theorem and Its Applications. Pacific Journal of Mathematics, 5(2), 285–309.

Troelstra, A. S., & van Dalen, D. (1988). Constructivism in Mathematics: An Introduction. North-Holland.