Proof nets for display logic

Simple item page
dc.creatorMoot, Richard
dc.date2007-11-15
dc.date.accessioned2026-07-07T08:43:08Z
dc.date.available2026-07-07T08:43:08Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/0711.2444
dc.identifierhttp://arxiv.org/abs/0711.2444
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142209
dc.subjectComputation and Language
dc.titleProof nets for display logic
dc.typetext

Files

Collections

arXiv