Relational semantics

Revision as of 14:23, 16 March 2009

Relational semantics

This is the simplest denotational semantics of linear logic. It consists in interpreting a formula $A$ as a set $A *$ and a proof $π$ of $A$ as a subset $π *$ of $A *$ .

The category of sets and relations

It is the category $\mathbf{Rel}$ whose objects are sets, and such that $\mathbf{Rel}(X,Y)=\mathcal P(X\times Y)$ . Composition is the ordinary composition of relations: given $s\in\mathbf{Rel}(X,Y)$ and $t\in\mathbf{Rel}(Y,Z)$ , one sets $t\circ s=\set{(a,c)\in X\times Z}{\exists b\in Y\ (a,b)\in s\ \text{and}\ (b,c)\in t}$ and the identity morphism is the diagonal relation $\mathsf{Id}_X=\set{(a,a)}{a\in X}$ .

An isomorphism in the category $\mathbf{Rel}$ is a relation which is a bijection, as easily checked.

Monoidal structure

The tensor product is the usual cartesian product of sets $X\tens Y=X\times Y$ (which is not a cartesian product in the category $\mathbf{Rel}$ in the categorical sense). It is a bifunctor: given $s_i\in\mathbf{Rel}(X_i,Y_i)$ (for $i = 1,2$ ), one sets $s_1\tens s_2=\set{((a_1,a_2),(b_1,b_2))}{(a_i,b_i)\in s_i\ \text{for}\ i=1,2}$ . The unit of this tensor product is $\one=\{*\}$ where $*$ is an arbitrary element.

For defining a monoidal category, it is not sufficient to provide the definition of the tensor product functor $\tens$ and its unit $\one$ , one has also to provide natural isomorphisms $\lambda_X\in\mathbf{Rel}(\one\tens X,X)$ , $\rho_X\in\mathbf{Rel}(X\tens\one,X)$ (left and right neutrality of $\one$ for $\tens$ ) and $\alpha_{X,Y,Z}\in\mathbf{Rel}((X\tens Y)\tens Z,X\tens(Y\tens Z))$ (associativity of $\tens$ ). All these isomorphisms have to satisfy a number of commutations. In the present case, they are defined in the obvious way.

This monoidal category $(\mathbf{Rel},\tens,\one,\lambda,\rho)$ is symmetric, meaning that it is endowed with an additional natural isomorphism $\sigma_{X,Y}\in\mathbf{Rel}(X\tens Y,Y\tens X)$ , also subject to some commutations. Here, again, this isomorphism is defined in the obvious way (symmetry of the cartesian product). So, to be precise, the SMCC (symmetric monoidal closed category) $\mathbf{Rel}$ is the tuple $(\mathbf{Rel},\tens,\one,\lambda,\rho,\alpha,\sigma)$ , but we shall simply denote it as $\mathbf{Rel}$ for simplicity.

The SMCC $\mathbf{Rel}$ is closed. This means that, given any object $X$ of $\mathbf{Rel}$ (a set), the functor $Z\mapsto Z\tens X$ (from $\mathbf{Rel}$ to $\mathbf{Rel}$ ) admits a right adjoint $Y\mapsto (X\limp Y)$ (from $\mathbf{Rel}$ to $\mathbf{Rel}$ ). In other words, for any objects $X$ and $Y$ , we are given an object $X\limp Y$ and a morphism $\mathsf{ev}_{X,Y}\in\mathbf{Rel}((X\limp Y)\tens X,Y)$ with the following universal property: for any morphism $s\in\mathbf{Rel}(Z\tens X,Y)$ , there is a unique morphism $\mathsf{fun}(s)\in\mathbf{Rel}(Z,X\limp Y)$ such that $\mathsf{ev}_{X,Y}\circ(\mathsf{fun}(s)\tens\mathsf{Id}_X)=s$ .

The definition of all these data is quite simple in $\mathbf{Rel}$ : $X\limp Y=X\times Y$ , $\mathsf{ev}_{X,Y}=\set{(((a,b),a),b)}{(a,b)\in X\times Y}$ and $\mathsf{fun}(s)=\set{(c,(a,b))}{((c,a),b)\in s}$ .

@@ Line 6: / Line 6: @@
 It is the category <math>\mathbf{Rel}</math> whose objects are sets, and such that <math>\mathbf{Rel}(X,Y)=\mathcal P(X\times Y)</math>. Composition is the ordinary composition of relations: given <math>s\in\mathbf{Rel}(X,Y)</math> and <math>t\in\mathbf{Rel}(Y,Z)</math>, one
-sets
+sets <math>t\circ s=\set{(a,c)\in X\times Z}{\exists b\in Y\ (a,b)\in s\ \text{and}\ (b,c)\in t}</math> and the identity morphism is the diagonal relation <math>\mathsf{Id}_X=\set{(a,a)}{a\in X}</math>.
-<math>t\circ s=\set{(a,c)\in X\times Z}{\exists b\in Y\ (a,b)\in s\ \text{and}\ (b,c)\in t}</math>
-and the identity morphism is the diagonal relation <math>\mathsf{Id}_X=\set{(a,a)}{a\in X}</math>.
 An isomorphism in the category <math>\mathbf{Rel}</math> is a relation which is a bijection, as easily checked.

Relational semantics

Revision as of 14:23, 16 March 2009