Concurrent games and full completeness
The DOI matches its Crossref record; 13 of the 13 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
Abramsky, S., & Jung, A. (1995) · Logic in Computer Science · Cited by 1,036
Self-citationDomain theory in logical form*
Abramsky, S. (1991) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(91)90065-t · Cited by 492
Self-citationPetri nets, event structures and domains
Nielsen, M., Plotkin, G. D., & Winskel, G. (2005) · Springer eBooks · doi:10.1007/bfb0022474 · Cited by 396
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-citationA game semantics for linear logic
Blass, A. (1992) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(92)90073-9 · Cited by 285
Bainbridge, E. S., Freyd, P. J., Scedrov, A., & Scott, P. J. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90151-7 · Cited by 159 · cited 2×
“We could avoid this logical detour by using a stronger property than dinaturality, namely Reynolds-style relational parametricity [BFSS88], for which closure under composition can be proved directly; however, this would complicate the description of the model, and dinaturality is sufficient to prove Full Completeness.”
MethodA new deconstructive logic: linear logic
Danos, V., Joinet, J.-B., & Schellinx, H. (1997) · Journal of Symbolic Logic · doi:10.2307/2275572 · Cited by 154
New Foundations for the Geometry of Interaction
Abramsky, S., & Jagadeesan, R. (1994) · Information and Computation · doi:10.1006/inco.1994.1041 · Cited by 113
Self-citationGames and full Completeness for multiplicative Linear Logic: Extended abstract
Abramsky, S., & Jagadeesan, R. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56287-7_113 · Cited by 70
Self-citationLinear logic, totality and full completeness
Loader, R. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1994.316060 · Cited by 45
Blute, R. F., & Scott, P. (1996) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(95)00017-8 · Cited by 45
Believe it or not, AJM's games model is a model of classical linear logic
Baillot, P., Danos, V., Ehrhard, T., & Régnier, L. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1997.614933 · Cited by 44 · cited 1×
“In fact, sequential games have only yielded satisfactory models of fragments of Linear Logic: the Multiplicative fragment in [AJ92b], the Multiplicative-Exponential fragment in [ BDER97 ], and the negative fragment in most other work.”
Background
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
- 13
- 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
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.