Skip to main content
Conference Proceedings

Games and full completeness for multiplicative linear logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 652 LNCS 291-301
DOI: 10.1007/3-540-56287-7_113
16Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Abramsky, S., & Jagadeesan, R. (1992). Games and full completeness for multiplicative linear logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 652 LNCS, pp. 291–301). Springer Verlag. https://doi.org/10.1007/3-540-56287-7_113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free