Skip to main content
SpringerLink
Log in

An algebraic correctness criterion for intuitionistic proof-nets

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

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

Included in the following conference series:

  • 110 Accesses

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. V. Danos. Une application de la logique linéaire à l'étude des processus de normalisation et principalement du lambda calcul. Thèse de doctorat, Université de Paris VII, 1990.

    Google Scholar 

  2. V. Danos and L. Régnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181–203, 1989.

    Google Scholar 

  3. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Google Scholar 

  4. J.-Y. Girard. Quantifiers in linear logic II. Technical Report 19, Equipe de Logique Mathématique, Université de Paris VII, 1991.

    Google Scholar 

  5. F. Lamarche. Proof nets for intuitionistic linear logic 1: Essential nets. Technical report, Imperial College, April 1994.

    Google Scholar 

  6. F. Lamarche. Games semantics for full propositional linear logic. In Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Press, 1995.

    Google Scholar 

  7. F. Lamarche and C. Retoré. Proof nets for the lambek calculus. In M. Abrusci, C. Casadio, and G. Sandri, editors, Third Roma Workshop: Proofs and Linguistic Categories, Rapporto di Ricerca del Dipartimento de Filosofia. Università di Bologna, 1996.

    Google Scholar 

  8. J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65:154–170, 1958.

    Google Scholar 

  9. D. Roorda. Resource Logics: proof-theoretical investigations. PhD thesis, University of Amsterdam, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Projet Calligramme, INRIA-Lorraine & CRIN-C.N.R.S., 615, rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France

    Philippe de Groote

Authors
  1. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Groote, P. (1997). An algebraic correctness criterion for intuitionistic proof-nets. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation