Semantic Isomers: Equivalence Beyond Syntax

• Semantic Isomers are distinct syntactic representations that result in identical semantic evaluations across all observational contexts.
• They enable lossless protocol adaptation by allowing adapter synthesis in session types, facilitating component retrieval in behavioral type systems.
• Their study exposes limitations in finite axiomatization within semiring semantics, challenging traditional automated reasoning and verification methods.

Semantic isomers are syntactic structures—types or interpretations—within type systems or logical semantics that, although not identical in their atomic form or presentation, yield indistinguishable behavior or semantic evaluation in every observational or formulaic context. The phenomenon is central both to the study of behavioral types in concurrent systems (notably session types) and to weighted/provenance logics via semiring semantics. Semantic isomers illuminate the boundaries between syntactic isomorphism and semantic equivalence, with implications for protocol design, component retrieval, algebraic logic, and automated reasoning.

1. Formal Definition and Foundational Setting

The notion of semantic isomer arises in two principal domains.

Session Types: Let $T, S$ range over session types defined by the grammar:

$$T ::= \texttt{end} \mid ?\,\tau.\,T \mid !\,\tau.\,T \mid T + S \mid T \oplus S$$

where $?\,\tau.T$ denotes input, $!\,\tau.T$ output, $T + S$ external choice, $T \oplus S$ internal choice, and $\texttt{end}$ termination. The duality operation interchanges $?$ and $!$; $+$ and $\oplus$.

Semiring Semantics: Fix a commutative semiring $S = (K, +, \cdot, 0, 1)$, relational signature $\tau$, and finite universe $A$. A $K$-interpretation $\pi$ assigns each literal $L \in \text{Lit}_A(\tau)$ an element of $K$. The extension to formulas $\varphi$ proceeds by the rules:

• $\pi\llbracket R(\bar a)\rrbracket = \pi(R(\bar a))$
• $$\pi\llbracket\varphi \lor \psi\rrbracket = \pi\llbracket\varphi\rrbracket + \pi\llbracket\psi\rrbracket$$
• $$\pi\llbracket\varphi \land \psi\rrbracket = \pi\llbracket\varphi\rrbracket \cdot \pi\llbracket\psi\rrbracket$$
• $$\pi\llbracket\exists x\,\varphi(x)\rrbracket = \sum_{a \in A} \pi\llbracket\varphi(a)\rrbracket$$
• $$\pi\llbracket\forall x\,\varphi(x)\rrbracket = \prod_{a \in A} \pi\llbracket\varphi(a)\rrbracket$$

Isomorphism for session types is witnessed by the existence of adapters $A: \overline{T} \triangleleft S$ and $B: \overline{S} \triangleleft T$ such that $A \parallel B \approx id_T$, $B \parallel A \approx id_S$ (where $\approx$ is process equivalence). In semiring semantics, $K$-interpretations $\pi_A$ and $\pi_B$ are isomorphic iff a bijection of universes matches atomic values.

Semantic Isomers: In both settings, the core definition concerns structures that are equivalent under all closed observations/formulas but not isomorphic:

• For session types, distinct protocols $T \not\equiv S$ may nonetheless be interchangeable by adapter synthesis.
• For semiring semantics, $(\pi_A, \pi_B)$ is a semantic isomer iff $\pi_A \equiv \pi_B$ but $\pi_A \not\cong \pi_B$ (Grädel et al., 2021).

2. Behavioral Equivalence and Process Notions

Session Types: The critical behavioral equivalence on processes is defined via correct termination: $P \approx Q$ iff, for every context $C[-]$, $C[P]$ and $C[Q]$ are both correct or both not correct. This equivalence is less discriminating than bisimilarity. For instance:

$$?c(x).\!c(\text{true}).0 \approx ?c(x).?c(y).\!c(\text{true}).0$$

although the output step is delayed in the right-hand process (Dezani-Ciancaglini et al., 2014).

Semiring Semantics: Elementary equivalence is defined by indistinguishability under all first-order sentences:

$$\pi_A \equiv \pi_B \Leftrightarrow \forall \varphi: \pi_A\llbracket\varphi\rrbracket = \pi_B\llbracket\varphi\rrbracket$$

This is strictly coarser than isomorphism, especially for semirings lacking cancellation.

3. Axiomatic and Classification Results

Session-Type Isomorphisms: The isomorphism relation $\cong$ on session types enjoys a finite list of axioms, each with dual versions:

• Commutativity of output/input: $!t.!s.T \cong !s.!t.T$; $?t.?s.T \cong ?s.?t.T$
• Distributivity over choices: $!t.(T \oplus S) \cong !t.T \oplus !t.S$; $?t.(T + S) \cong ?t.T + ?t.S$
• Elimination of units: $!unit.T \cong T$; $?unit.T \cong T$
• Boolean expansion: $!bool.T \cong T \oplus T$; $?bool.T \cong T + T$
• Commutativity and associativity of choices and branches: $T \oplus S \cong S \oplus T$, $T + S \cong S + T$, $$(T_1 \oplus T_2) \oplus T_3 \cong T_1 \oplus (T_2 \oplus T_3)$$, $(T_1 + T_2) + T_3 \cong T_1 + (T_2 + T_3)$

Each axiom admits explicit adapters $A_i, B_i$ witnessing the equivalences (Dezani-Ciancaglini et al., 2014). Soundness is established by producing such adapters and proving $A_i \parallel B_i \approx id_{lhs}$, $B_i \parallel A_i \approx id_{rhs}$.

Semiring Semantics: Classification theorems determine for which semirings semantic isomers exist.

• Negative results: For min-max semirings, positive Boolean expressions $PosBool[X]$, and certain universal polynomial semirings $B[X]$, semantic isomers exist: there are finite interpretations $\pi_A, \pi_B$ with $\pi_A \equiv \pi_B$ but $\pi_A \not\cong \pi_B$. This is witnessed by swaps of atomic values that sum/product combinations cannot distinguish.
• Positive results: For cancellative semirings—Viterbi ($V$), tropical ($T$), natural numbers ($\mathbb{N}$), polynomial semiring $\mathbb{N}[X]$—elementary equivalence implies isomorphism. For any finite interpretation, an infinite (typically countable) set of first-order sentences suffices to ensure uniqueness up to isomorphism (Grädel et al., 2021).

4. Methods and Proof Techniques

Table: Key techniques for semantic isomer construction and detection

Technique	Role	Applicable Domain
Reduction by semiring homomorphisms	Characterizes equivalence	Semiring semantics
Adapter synthesis (process-side)	Witnesses isomorphism	Session types
Ehrenfeucht–Fraïssé game failure	Diagnoses breakdown of matching	Semiring semantics
Exploitation of absorption/idempotence	Enables isomers	Boolean/idempotent semirings
Characteristic-sentence construction	Axiomatizes up to isomorphism	Cancellative semirings

Reduction via separating sets of semiring homomorphism pairs $(h_A, h_B)$ allows one to check elementary equivalence by evaluating interpretations in a “simpler” semiring (often Boolean). Adapter synthesis produces the necessary mediators (processes $A$, $B$) for session-type isomorphism. The characteristic-sentence method in cancellative semirings encodes tuples of atomic values so as to rule out non-isomorphic matches. The breakdown of cancellation and use of absorption/idempotence enable isomeric interpretations that are not matched by bijections but are semantically indistinguishable.

5. Canonical Examples

Session Types:

• Swapping outputs: $T = !int.!bool.end$, $S = !bool.!int.end$; $T \cong S$ via adapters $A = ?int(x).?bool(y).!bool(y).!int(x).0$ and $B = ?bool(y).?int(x).!int(x).!bool(y).0$.
• Distributivity over choice: $!t.(T\oplus S) \cong (!t.T) \oplus (!t.S)$.
• Elimination of unit exchange: $!unit.T \cong T$.

Semiring Semantics:

Minimal min–max isomers: For $K = \{0,1,2,3\}$, universe $A = \{a,b\}$, predicates $P, Q$:

$\begin{array}{c|cc|cc} & P(a) & P(b) & Q(a) & Q(b) \ \hline \pi & 1 & 2 & 3 & 1 \ \pi' & 3 & 1 & 1 & 2 \ \end{array}$

Every first-order formula yields equal values under $\pi$ and $\pi'$, but there is no bijection mapping atomic values—$\pi$ and $\pi'$ form a semantic isomer pair (Grädel et al., 2021).

6. Implications for Component Retrieval and Logical Reasoning

In typed component libraries using behavioral types as keys, semantic isomers enable retrieval of components by behavioral equivalence rather than exact type match. This permits lossless protocol adaptation via synthesized adapters, greatly enhancing component reuse. For example, protocols differing only in the order of independent messages can be mediated by an adapter without loss of correctness (Dezani-Ciancaglini et al., 2014).

In semiring-valued logics, semantic isomers expose the limits of finite axiomatisation for weighted model-checking—some interpretations are indistinguishable by any finite family of first-order sentences, leading to challenges in automated reasoning and verification. Systems relying on first-order expressiveness must either tolerate infinite axioms or restrict to semirings where cancellation rules out isomers.

7. Open Problems and Further Directions

Several open directions remain. For session-type isomorphisms, completeness of the finite axiomatization is unresolved; it is undetermined whether further isomorphisms exist outside the twelve known rules. For semiring semantics, extending the theory to infinite universes, richer algebraic structures (non-commutative, non-idempotent), and providing game-theoretic characterizations (analogous to Ehrenfeucht–Fraïssé games) are active research problems. A plausible implication is that weighted logics may require augmentation (e.g., incorporation of real-valued formulae) to overcome the distinguishing power of first-order logic in the presence of semantic isomers (Grädel et al., 2021).