Skip to main content
SpringerLink
Log in

A parallel game semantics for Linear Logic

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

We describe the constructive content of proofs in a fragment of propositional Infinitary Linear Logic in terms of strategies for a suitable class of games. Such strategies interpret linear proofs as parallel algorithms as long as the asymmetry of the connectives ? and ! allows it.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dipartimento di Matematica dell'Università di Trento, Povo, I-38050 Povo (TN), Italy (baratella@science.unitn.it), , , , , , IT

    Stefano Baratella

  2. Dipartimento di Informatica dell'Università di Torino, Corso Svizzera 185, I-10149 Torino (TO), Italy (stefano@pianeta.di.unito.it), , , , , , IT

    Stefano Berardi

Authors
  1. Stefano Baratella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Berardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received December 5, 1994

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baratella, S., Berardi, S. A parallel game semantics for Linear Logic. Arch Math Logic 36, 189–217 (1997). https://doi.org/10.1007/s001530050061

Download citation

  • Issue Date:

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

Keywords

Search

Navigation