Skip to main content
SpringerLink
Log in

Is game semantics necessary?

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 832))

Included in the following conference series:

Abstract

We discuss the extent to which game semantics is implicit in the basic concepts of linear logic.

Partially supported by NSF grant DMS-9204276.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic (to appear).

    Google Scholar 

  2. A. Blass, A game semantics for linear logic, Ann. Pure Appl. Logic 56 (1992), 183–220.

    Article  MATH  MathSciNet  Google Scholar 

  3. P.-L. Curien, Concrete data structures, sequential algorithms, and linear logic, electronic posting on Types network (1992).

    Google Scholar 

  4. M. Dummett, Elements of Intuitionism, Oxford University Press, 1977.

    Google Scholar 

  5. D. Gale and F. M. Stewart, Infinite games with perfect information, Ann. Math. Studies 28 (1953), 245–266.

    MathSciNet  Google Scholar 

  6. J.-Y. Girard, Linear logic, Theoret. Comp. Sci. 50 (1987), 1–102.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.-Y. Girard. Towards a geometry of interaction, Categories in Computer Science and Logic (J. Gray and A. Scedrov, eds.), Contemp. Math. 92, Amer. Math. Soc., 1989, pp. 69–108.

    Google Scholar 

  8. J.-Y. Girard, Y. Lafont, and P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press, 1989.

    Google Scholar 

  9. W. A. Howard, The formulae-as-types notion of construction, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J. R. Hindley and J. P. Seldin, eds.), Academic Press, 1980, pp. 479–490.

    Google Scholar 

  10. J. M. E. Hyland and C.-H. L. Ong, Fair games and full completeness for multiplicative linear logic without the MIX-rule, preprint (1993).

    Google Scholar 

  11. F. Lamarche, Sequentiality, games and linear logic, preprint (1992).

    Google Scholar 

  12. P. Lorenzen, Ein dialogisches Konstruklivitätskriterium, Infinitistic Methods, PWN, 1961, pp. 193–200.

    Google Scholar 

  13. H. Simmons, Logic and Computation — Taking the Curry-Howard Correspondence Seriously, Lecture notes distributed at the European Summer Meeting of the Association for Symbolic Logic, Keele, England, 1993.

    Google Scholar 

  14. A. S. Troelstra and D. van Dalen, Constructivism in Mathematics — An Introduction, Vol.1, North-Holland, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Dept., University of Michigan, 48109, Ann Arbor, MI, USA

    Andreas Blass

Authors
  1. Andreas Blass
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blass, A. (1994). Is game semantics necessary?. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049324

Download citation

  • DOI: https://doi.org/10.1007/BFb0049324

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58277-9

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation