(Enter summary)
Abstract: The essential interaction between classical and intuitionistic features
in the system of linear logic is best described in the language
of category theory. Given a symmetric monoidal closed category C
with products and coproducts, the category C \Theta C
op
can be given the
structure of a -autonomous category by a special case of the Chu
construction. The main result of the paper is to show that the intuitionistic
translations induced by Girard's trips determine the functor
from the... (Update)
Context of citations to this paper: More
...strategies. 2) More recently, Bellin has made use of this construction in his analysis of the meaning of the long trip condition. In [10] he considers C d where C is the free symmetric monoidal category with nite products. 3) In our work on categories of abstract games...
Cited by: More
Glueing and Orthogonality for Models of Linear Logic - Hyland (2001)
(Correct)
Active bibliography (related documents): More All
0.3: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000)
(Correct)
0.3: Resource Interpretations, Bunched Implications and the.. - O'Hearn
(Correct)
0.3: Two paradigms of logical computation in Affine Logic? - Bellin (1999)
(Correct)
Similar documents based on text: More All
0.2: A 2-dimensional view of the Chu-construction - Koslowski (2000)
(Correct)
0.2: The Chu Construction - Barr (1996)
(Correct)
0.2: The Stone Gamut: A Coordinatization of Mathematics - Pratt (1995)
(Correct)
Related documents from co-citation: More All
2: volume 752 of Lecture Notes in Mathematics (context) - Barr, categories - 1979
BibTeX entry: (Update)
G. Bellin. Chu's Construction: A Proof-theoretic Approach. Submitted for publication. http://citeseer.ist.psu.edu/bellin99chus.html More
@misc{ bellin-chus,
author = "G. Bellin",
title = "Chu's Construction: A Proof-theoretic Approach",
text = "G. Bellin. Chu's Construction: A Proof-theoretic Approach. Submitted for
publication.",
url = "citeseer.ist.psu.edu/bellin99chus.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
175
Games and Full Completeness for Multiplicative Linear Logic
- Abramsky, Jagadeesan - 1994
66
What is a Categorical Model of Intuitionistic Linear Logic
- Bierman - 1995
60
A term calculus for intuitionistic linear logic
- Benton, Bierman et al. - 1993
40
Proof-nets: the parallel syntax for proof-theory (context) - Girard - 1995
32
Mathematical Structures in Computer Science (context) - Barr, categories et al. - 1991
29
Fair games and full completeness for Multiplicative Linear L..
- Hyland, Ong - 1993
24
Mathematical Structures in Computer Science (context) - Fleury, Retor'e et al. - 1994
22
the unity of logic (context) - Girard - 1993
22
Lecture Notes in Mathematics (context) - Barr, categories - 1979
16
Mechanizing Proof Theory: Resource-Aware Logics and ProofTra.. (context) - Bellin - 1990
5
Subnets of Proof-nets in MLL \Gamma (context) - Bellin, Wiele - 1995
3
Linear -Calculus and Categorical Models Revisited (context) - Benton, Bierman et al.
1
Games Semantics for Full Propositional Logic (context) - Lamarche
Documents on the same site (http://profs.sci.univr.it/~bellin/papers.html): More
Subnets of Proof-nets in MLL- - Bellin, Wiele (1994)
(Correct)
Planar and Braided Proof-Nets for Multiplicative Linear Logic .. - Bellin, Fleury (1997)
(Correct)
Two paradigms of logical computation in Affine Logic? - Bellin (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC