Skip to Main content Skip to Navigation
Other publications

Proof nets for display logic

Richard Moot 1, 2, * 
* Corresponding author
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
INRIA Futurs, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université Bordeaux Montaigne, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : This paper explores several extensions of proof nets for the Lambek calculus in order to handle the different connectives of display logic in a natural way. The new proof net calculus handles some recent additions to the Lambek vocabulary such as Galois connections and Grishin interactions. It concludes with an exploration of the generative capacity of the Lambek-Grishin calculus, presenting an embedding of lexicalized tree adjoining grammars into the Lambek-Grishin calculus.
Document type :
Other publications
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Richard Moot Connect in order to contact the contributor
Submitted on : Monday, November 12, 2007 - 6:47:12 PM
Last modification on : Saturday, June 25, 2022 - 8:29:35 PM
Long-term archiving on: : Monday, April 12, 2010 - 1:59:09 AM


Publisher files allowed on an open archive


  • HAL Id : inria-00186911, version 1
  • ARXIV : 0711.2444


Richard Moot. Proof nets for display logic. 2007. ⟨inria-00186911⟩



Record views


Files downloads