Studia Logica

, Volume 71, Issue 3, pp 415–442

Proof Nets for the Multimodal Lambek Calculus

  • Richard Moot
  • Quintijn Puite

DOI: 10.1023/A:1020525032763

Cite this article as:
Moot, R. & Puite, Q. Studia Logica (2002) 71: 415. doi:10.1023/A:1020525032763


We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calculus Las an instance of our general correctness criterion.

Cut EliminationLambek CalculusLinear LogicMultimodal Lambek CalculusProof NetsProof Theory

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Richard Moot
    • 1
  • Quintijn Puite
    • 2
  1. 1.Utrecht Institute of Linguistics OTSUtrecht UniversityNetherlands
  2. 2.Department of MathematicsUtrecht UniversityNetherlands