The DOI matches its Crossref record.
Linear logic, *-autonomous categories and cofree coalgebras
Abstract
. A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed -calculus. The linear structure amounts to a -autonomous category: a closed symmetric monoidal category G with finite products and a closed involution. Girard's exponential operator, ! , is a cotriple on G which carries the canonical comonoid structure on A with respect to cartesian product to a comonoid structure on !A with respect to tensor product. This makes the Kleisli category for ! cartesian closed. 0. INTRODUCTION. In "Linear logic" [1987], Jean-Yves Girard introduced a logical system he described as "a logic behind logic". Linear logic was a consequence of his analysis of the structure of qualitative domains (Girard [1986]): he noticed that the interpretation of the usual conditional ")" could be decomposed into two more primitive notions, a linear conditional "\\Gammaffi" and a unary operator "!" (called "of cours...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
A categorical semantics of quantum protocols
Abramsky, S., & Coecke, B. (2004) · Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. · doi:10.1109/lics.2004.1319636 · Cited by 541
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
Rewriting Logic as a Logical and Semantic Framework
Martí-Oliet, N., & Meseguer, J. (2002) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0464-9_1 · Cited by 253
Metadata
- Authors
- Seely, R. A. G.
- Venue
- Contemporary Mathematics
- Publisher
- American Mathematical Society
- Published
- 1989
- Pages
- 371-382
- ISSN
- 0271-4132 (ISSN-L)
- 1098-3627
- OpenAlex
- W4256453086
- Cited by
- 172
- References
- 0
- Type
- other
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear logic, *-autonomous categories and cofree coalgebras. https://app.cochat.ai/papers/10.1090/conm/092/1003210
- The paper
- Seely, R. A. G. (1989). Linear logic, *-autonomous categories and cofree coalgebras. Contemporary Mathematics. https://doi.org/10.1090/conm/092/1003210
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.