Exhausting strategies, joker games and full completeness for IMLL with unit (Preliminary Version)

Electronic Notes in Theoretical Computer Science

Volumn 29, Issue , 1999, Pages 209-239

  Murawski, A S ^a   Ong, C H L ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

INTUTIONISTIC MULTIPLICATIVE LINEAR LOGIC; LINEAR LOGIC; P-EXHAUSTION; TRIPLE UNIT PROBLEM;

GAME THEORY;

EID: 18944388163     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80317-2     Document Type: Conference Paper

References (12)

1. Abramsky S. Semantics of interaction: an introduction to game semantics. Semantics and Logics of Computation. 1997;1-32 Cambridge Univ. Press
2. Abramsky S., Jagadeesan R. Games and full completeness for multiplicative linear logic. J. Symb. Logic. 59:1994;543-574
3. Barr M. *-autonomous categories and linear logic. Mathematical Structures in Computer Science. 1:1991;159-178
4. Girard J.-Y. Linear logic. Theoretical Computer Science. 50:1987;1-102
5. Hyland J.M.E., Ong C.-H.L. Fair games and full completeness for Multiplicative Linear Logic without the MIX-rule. preprint. 1993
6. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. To appear in Information and Computation, ftp-able from Ong's homepage, 1997.
7. Kelly G.M., MacLane S. Coherence in closed categories. Journal of Pure and Applied Algebra. 1:1971;97-140
8. T. W. Koh and C.-H. L. Ong. Type theories for autonomous and *-autonomous categories: I. types theories and rewrite systems II. internal languages and coherence theorems, preprint, 65 pages, ftp-able from Ong's homepage, 1998.
9. T. W. Koh and C.-H. L. Ong. Explicit substitution internal languages for autonomous and *-autonomous categories. To appear in the ENTCS Proceedings of Category Theory and Computer Science 1999, 34pp., ftp-able from Ong's homepage, 1999.
10. Lamarche F. Proof Nets for Intuitionistic Logic 1: Essential Nets. Preprint ftp-able from Hypatia. 1994
11. Murawski A.S., Ong C.-H.L. A linear-time algorithm for verifying MLL proof nets via Lamarche's essential nets. Preprint, 8 pp., ftp-able from Ong's homepage. 1999
12. Nickau H. Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality. PhD thesis, Universität-Gesamthochschule-Siegen. 1996