The Semantic Domain

What this lesson covers

The semantic side of the semiotic universe: the complete Heyting algebra $H$ that houses all meanings, the modal closure operator $j$ that distinguishes stable from provisional meanings, and the trace comonad $G$ that tracks how meanings unfold over time. These three structures — logical, modal, and temporal — and the axioms governing their interaction form the ambient environment in which everything else is built.

Prerequisites

Familiarity with Heyting algebras and closure operators. The lesson on Intuitionistic Logic provides useful background. Knowledge of comonads is helpful but not required — we explain the core idea here.

---

The complete Heyting algebra

The semiotic universe begins with a domain of semantic objects: all the possible meanings that signs can carry. This domain is a complete Heyting algebra $(H,\le )$, equipped with:

• A partial order $\le$ — expressing entailment or refinement of meaning.
• Binary meets $\wedge$ and joins $\vee$ — conjunction and disjunction.
• An implication $\Rightarrow$ satisfying the residuation law: $c\le (a\Rightarrow b)$ if and only if $c\wedge a\le b$.
• Top $\top$ (the trivial meaning) and bottom $\perp$ (the absurd meaning).
• All joins and meets exist, not just finite ones — the algebra is complete.

The choice of a Heyting algebra rather than a Boolean algebra is deliberate. In a Boolean algebra every proposition is either true or false; in a Heyting algebra it is possible for $a\vee \neg a$ to be less than $\top$. This reflects a constructive stance: the semantic domain does not assume that every question has a determinate answer. Some meanings are genuinely indeterminate, provisional, or in process (Troelstra & van Dalen, 1988).

The underlying poset $(H,\le )$ can be viewed as a thin category: objects are elements of $H$, and there is a unique morphism $a\to b$ whenever $a\le b$. This categorical perspective becomes important when we define morphisms between semiotic universes.

The modal closure operator

Not all meanings in $H$ are equally settled. Some are provisional — still subject to revision — while others are stable. The modal closure operator $j:H\to H$ formalizes this distinction. It satisfies four properties:

1. Extensive: $a\le j(a)$. Stabilizing a meaning can only add information, not remove it.
2. Monotone: if $a\le b$ then $j(a)\le j(b)$. The order is respected.
3. Idempotent: $j(j(a))=j(a)$. Stabilizing something already stable does nothing.
4. Join-continuous: $j({\bigvee }_{i\in I}{a}_i)={\bigvee }_{i\in I}j(a_i)$ for any family $\{a_i\}$. Stabilization distributes over disjunction.

The fixed points of $j$ — the elements $a$ where $j(a)=a$ — form the stable fragment:

$$H^{\mathrm{st}}:=\{a\in H:j(a)=a\}.$$

These are the settled meanings: the ones that do not change under further stabilization. The stable fragment $H^{\mathrm{st}}$ is itself a complete Heyting subalgebra of $H$, and the inclusion $H^{\mathrm{st}}\hookrightarrow H$ is a Heyting homomorphism. This follows from the join-continuity of $j$ combined with the residuation law.

Semiotically, $j$ models what Peirce called the movement toward a “final interpretant” — the tendency of interpretation to settle, even if the actual process of semiosis never terminates. An element $a$ in $H$ is the meaning as currently constituted; $j(a)$ is what that meaning would be if all provisional aspects were resolved.

The trace comonad

The second operator on $H$ tracks provenance — the history of how a meaning was constructed. This is the trace operator $G:H\to H$, which forms a comonad on the poset-category of $H$.

A comonad consists of three components:

• An endofunctor $G:H\to H$ (monotone, since the category is a poset).
• A counit $ϵ:G(a)\le a$ — the trace of a meaning entails that meaning. Provenance does not add content.
• A comultiplication $\delta :G(a)\le G(G(a))$ — the trace of a meaning itself has a trace. Histories are recursive.

These satisfy the coassociativity and counit laws that make the triple $(G,ϵ,\delta )$ a comonad.

What makes $G$ special in this context is its algebraic compatibility. The trace is not just a comonad — it is also a complete Heyting algebra endomorphism:

1. $G({\bigvee }_i{a}_i)={\bigvee }_{i}G(a_i)$ — traces distribute over joins.
2. $G(a\wedge b)=G(a)\wedge G(b)$, $G(\top )=\top$, $G(\perp )=\perp$ — traces preserve meets and bounds.
3. $G(a\Rightarrow b)=G(a)\Rightarrow G(b)$ — traces preserve implication.

This is a strong requirement: it means that tracing respects the entire logical structure of the semantic domain. The trace of a conjunction is the conjunction of the traces. The trace of an implication is an implication between traces. Provenance tracking does not distort meaning.

How modality and trace interact

The two operators $j$ and $G$ are not independent. They are constrained by interaction axioms that ensure coherence between stability (modal) and provenance (temporal) structure.

Basic interaction: for all $a\in H$,

$$j(G(a))\le G(j(a)).$$

Stabilizing the trace of a meaning gives something that entails the trace of the stabilized meaning. In other words, if you first look at the history and then ask what it settles to, you get something no stronger than if you first settle the meaning and then trace the stabilized version.

Stability equivalence: an element is stable if and only if its trace is stable:

$$G(a)\in H^{\mathrm{st}}⟺a\in H^{\mathrm{st}}.$$

This is a powerful constraint. It says that the question “is this meaning settled?” cannot be changed by examining its history — stability is intrinsic, not an artifact of how the meaning was constructed. Conversely, if a meaning’s trace is settled, the meaning itself must be settled.

Together, these axioms ensure that the restriction of $G$ to the stable fragment $H^{\mathrm{st}}$ is itself a comonad and a Heyting endomorphism. The stable fragment, equipped with the identity as its modality and the restricted trace, is a complete substructure of the full semantic domain.

What the semantic domain provides

The triple $(H,j,G)$ — a complete Heyting algebra with modal closure and Heyting-comonadic trace — is the ambient environment in which all further construction takes place. It provides:

• A logic: the Heyting algebra structure gives constructive propositional reasoning.
• A notion of stability: the modal closure operator $j$ partitions meanings into provisional and settled.
• A notion of provenance: the trace comonad $G$ tracks how meanings were constructed.
• Coherence: the interaction axioms ensure that these three aspects agree with each other.

The next lesson — Syntactic Operators — introduces the typed lambda calculus that generates the grammar of the sign system and shows how syntactic operations are interpreted in this semantic domain.

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