• 検索結果がありません。

Coherence of the Double Negation in Linear Logic (Algebra, Logic and Geometry in Informatics)

N/A
N/A
Protected

Academic year: 2021

シェア "Coherence of the Double Negation in Linear Logic (Algebra, Logic and Geometry in Informatics)"

Copied!
3
0
0

読み込み中.... (全文を見る)

全文

(1)

Coherence of the Double

Negation in

Linear

Logic

Masahito

Hasegawa (長谷川真人)

RIMS, Kyoto University (京都大学数理解析研究所)

PRESTO,

JST

(科学技術振興事業団さきがけ研究 21)

Many formulations ofproof nets and sequent calculi for Classical Linear Logic (CLL) $[7, 8]$ take it for granted that atype $A$ is identical to its double

negation$A^{[perp][perp]}.$.Onthe otherhand, sinceSeely [13], it has been assumed that $*$-autonomous categories $[1, 2]$ are the appropriate semantic models of (the

multiplicative fragment of) CLL. However, in general, in

a

$*$-autonomous category anobject $A$ is only canonically isomorphic to its double involution

$A^{**}$

.

For instance, in the category of finite dimensional vector spaces and

linear maps, avector space $V$ is only isomorphic to its double dual $V^{**}$

.

This raises the questions$\mathrm{w}\mathrm{h}\mathrm{e}\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{r}*$-autonomous categories do not, after all,

provide an accurate semantic model for these proofnets and whether there

could be semantically non-identical proofs (or morphisms), which must be

identified in any system which assumes atype is identical to its double

negation. Whether this can happen is not completely obvious

even

when

one examines purely syntactic descriptions of proofs with the isomorphism

between $A$ and $A^{[perp][perp]}$ present

such as $[11, 9]$ or the alternative proof net systems of [4] which

are

faithful to the categorical semantics.

Fortunately, there is

no

such semantic gap: in this talk we provide a

coherence theorem on the double involution

on

$*$-autonomous categories, which tells usthat there is nodifferencebetween the up-t0-identity approach

and theup-t0-isomorphism approach, as faras this double-negation problem

is concerned.

Theorem. Any$ffee*$-autonornous category is strictly equivalent

to a

free

$*$-autonornous category in which the double-involution

$(-)^{**}$ is the identity

functor

and the canonical isomorphism $A\simeq$

$A^{**}$ is an identity

arrow

for

all $A$

.

This remains true under the presence of linear exponential comonads and

finite products (the semantic counterpart of exponentials and additives

re-spectively). Our proof is fairly short and simple, and we suspect that this

Joint work with J.R.B. Cockettand R.A.G. Seely [5]

数理解析研究所講究録 1318 巻 2003 年 133-135

(2)

is folklore among specialists (at least everyone would expect such a result),

though we are not

aware

ofan explicit treatment of this issue in the

litera-ture.

This result should be compared with the classical coherence theorem for

monoidal categories,

as

found e.g. in $[12, 10]$

.

In fact,

we

follow the proof

strategy by JoyalandStreet in [10]. We first showaweaker form of coherence theorem which turns $\mathrm{a}*$-autonomous category into

an

equivalent one with

“strict involution” (where $A^{**}$ is identical to $A$), for which we ma $\mathrm{e}$ use of

(a simplified version of)

a

construction of Cockett and Seely [6]. We then strengthenit to aform of ”all diagrams commute” result by someadditional arguments

on

the structure-preserving functors. In this way, this work also

demonstrates the applicability ofthe Joyal-Street argument (which actually

can be seen an instance of a general flexibility result on free algebras of

2-monads developped by Blackwell, Kelly and Power [3]$)$ to other sorts of

coherence problems.

References

[1] Barr, M. (1979) $*$-Autonomous Categories. Springer Lecture Notes in

Math. 752.

[2] Barr, M. (1991)*-autonomous categories andlinear logic. Math. Struct.

Comp. Sci. 1, 159-178.

[3] Blackwell, R., Kelly, G.M. md Power, A.J. (1989) Two-dimensional

monad theory. J. Pure All. Algebra 59, 1-41.

[4] Blute, R.F., Cockett, J.R.B., Seely, R.A.G. and Trimble, T.H. (1996)

Natural deduction and coherence for weakly distributive categories. J. Pure Appl. Algebra 113(3), 229-296.

[5] Cockett, J.R.B., Hasegawa, M. and Seely, R.A.G. (2003) Coherence of

the double involution$\mathrm{o}\mathrm{n}*$-autonomous categories. Manuscript.

[6] Cockett, J.R.B. and Seely, R.A.G. (1999) Linearlydistributive functors.

J. Pure Appl. Algebra 143, 155-203.

[7] Girard, J.-Y. (1987) Linear logic. Theoret. Comp. Sci. 50, 1-102.

[8] Girard, J.-Y. (1995) Linear logic: its syntax andsemantics. InAdvances

in LinearLogic, London Mathematical Society Lecture NoteSeries 222,

pp. 1-42.

(3)

[9] Hasegawa, M. (2002) Classical linear logic of implications. In Proc. Computer Science Logic (CSL’02), Springer Lecture Notes in Comp. Sci. 2471, pp. 458-472.

[10] Joyal, A. and Street, R. (1993) Braided tensor categories. Adv. Math.

102, 20-78.

[11] Koh, T.W. and Ong, C.-H.L. (1999) Explicit substitution internal

lan-guages for autonomous and $*$-autonomous categories. In Proc.

Cate-gory Theory and ComputerScience (CTCS’99), Electron. Notes Theor.

Comput. Sci. 29.

[12] Mac Lane, S. (1971) Categories

for

the Working Mathematician. $\mathrm{G}\mathrm{r}\mathrm{a}\mathrm{d}-$

uate Texts in Mathematics 5, Springer-Verlag.

[13] Seely, R.A.G. (1989) Linear logic, $*$-autonomous categories and cofree

coalgebras. In Categories in Computer Science, AMS Contemporary

Mathematics 92, pp. 371-389

参照

関連したドキュメント

We have described the classical loss network model similar to that of Kelly [9]. It also arises in variety of different contexts. Appropriate choices of A and C for the

This year, the world mathematical community recalls the memory of Abraham Robinson (1918–1984), an outstanding scientist whose contributions to delta-wing theory and model theory

Specifically, we consider the glueing of (i) symmetric monoidal closed cat- egories (models of Multiplicative Intuitionistic Linear Logic), (ii) symmetric monoidal adjunctions

3.1, together with the result in (Barber and Plotkin 1997) (completeness via the term model construction), is that the term model of DCLL forms a model of DILL, i.e., a

Light linear logic ( LLL , Girard 1998): subsystem of linear logic corresponding to polynomial time complexity.. Proofs of LLL precisely captures the polynomial time functions via

Polarity, Girard’s test from Linear Logic Hypersequent calculus from Fuzzy Logic DM completion from Substructural Logic. to establish uniform cut-elimination for extensions of

The main difference between classical and intuitionistic (propositional) systems is the implication right rule, where the intuitionistic restriction is that the right-hand side

It turned out that the propositional part of our D- translation uses the same construction as de Paiva’s dialectica category GC and we show how our D-translation extends GC to