inria-00186911, version 1
Proof nets for display logic
Richard Moot
a, 1, 2
Draft paper of a proposal to use proof nets for display logic by generalising techniques used for the multimodal Lambek calculus (2007)
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.
- a – CNRS
- 1: SIGNES (INRIA Futurs)
- INRIA – CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Université Michel de Montaigne - Bordeaux III – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
- 2: Laboratoire Bordelais de Recherche en Informatique (LaBRI)
- CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
- Domain : Computer Science/Computation and Language
- Keywords : proof nets – lexicalized tree adjoining grammars – Lambek-Grishin calculus
- inria-00186911, version 1
- http://hal.inria.fr/inria-00186911
- oai:hal.inria.fr:inria-00186911
- From: Richard Moot
- Submitted on: Monday, 12 November 2007 18:47:12
- Updated on: Thursday, 15 November 2007 16:41:50
Associated documents
Export