Skip to main content

Non-commutativity and MELL in the Calculus of Structures

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

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

Included in the following conference series:

Abstract

We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual non-commutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its presentation in the calculus of structures, especially because we can replace the ordinary, global promotion rule by a local version. These formal systems, for which we prove cut elimination, outline a range of techniques and properties that were not previously available. Contrarily to what happens in the sequent calculus, the cut elimination proof is modular.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Samson Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543–574, June 1994.

    Google Scholar 

  2. V. Michele Abrusci and Paul Ruet. Non-commutative logic I: The multiplicative fragment. Annals of Pure and Applied Logic, 101(1):29–64, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297–347, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. Kai Brünnler and Alwen Tiu. A local system for classical logic. In preparation.

    Google Scholar 

  5. Gerhard Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland, Amsterdam, 1969.

    Google Scholar 

  6. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  7. Jean-Yves Girard. Proof Theory and Logical Complexity, Volume I, volume 1 of Studies in Proof Theory. Bibliopolis, Napoli, 1987. Distributed by Elsevier.

    Google Scholar 

  8. Alessio Guglielmi. A calculus of order and interaction. Technical Report WV-99-04, Dresden University of Technology, 1999. On the web at: http://www.ki.inf.tudresden.de/guglielm/Research/Gug/Gug.pdf.

  9. Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327–365, May 1994.

    Google Scholar 

  10. Dale Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, 1992 Workshop on Extensions to Logic Programming, volume 660 of Lecture Notes in Computer Science, pages 242–265. Springer-Verlag, 1993.

    Google Scholar 

  11. Dale Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165:201–232, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  12. Robin Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

  13. Christian Retoré. Pomset logic: A non-commutative extension of classical linear logic. In Ph. de Groote and J. R. Hindley, editors, TLCA’97, volume 1210 of Lecture Notes in Computer Science, pages 300–318, 1997.

    Google Scholar 

  14. Christian Retoré. Pomset logic as a calculus of directed cographs. In V. M. Abrusci and C. Casadio, editors, Dynamic Perspectives in Logic and Linguistics, pages 221–247. Bulzoni, Roma, 1999. Also available as INRIA Rapport de Recherche RR-3714.

    Google Scholar 

  15. Paul Ruet. Non-commutative logic II: Sequent calculus and phase semantics. Mathematical Structures in Computer Science, 10:277–312, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  16. Lutz Straßburger. MELL in the calculus of structures. Technical Report WV-2001-03, Dresden University of Technology, 2001. On the web at: http://www.ki.inf.tudresden.de/lutz/els.pdf.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guglielmi, A., Straßburger, L. (2001). Non-commutativity and MELL in the Calculus of Structures. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44802-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42554-0

  • Online ISBN: 978-3-540-44802-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics