Concurrent games and full completeness
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for Multiplicative-Additive Linear Logic is proved for this semantics.
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
Cites
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378 · cited 5×
“This exactly captures the idea of informational independence between Player’s actions in A and in B (cf. [AJ92b]).”
BackgroundMethodResultInfluentialSelf-citation
Cited by
(2006) · Cited by 17
Metadata
- Authors
- Abramsky, S., & Mellies, P.-A.
- Venue
- Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 431-442
- OpenAlex
- W2107067818
- Cited by
- 171
- References
- 2
- FWCI
- 6.63
- Type
- conference paper
- 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: Concurrent games and full completeness. https://app.cochat.ai/papers/10.1109/lics.1999.782638
- The paper
- Abramsky, S., & Mellies, P.-A. (2003). Concurrent games and full completeness. Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158). https://doi.org/10.1109/lics.1999.782638
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.