Classical non-associative Lambek calculus
type: Item
instance of: scholarly article
title: Classical non-associative Lambek calculus
zbMATH Open document ID: 1032.03014
DOI: 10.1023/A:1020520915016
author: Philippe de Groote
author: François Lamarche
published in: Studia Logica
publication date: 2002-12-15T00:00:00Z
review text: The aim of the paper is to present CNL, a classical version of the nonassociative Lambek calculus NL. CNL is presented as a sequent calculus, along with its associated theory of proof-nets. This theory includes a correctness criterion, which is defined on the cut-free proof-structure. It is proved that CNL is decidable in polynomial time. It is also shown that CNL can be treated as a conservative extension of NL.
reviewed by: Mirosława Kołowska-Gawiejnowicz
Mathematics Subject Classification ID: 03B47
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 1845368
zbMATH Keywords: non-associative Lambek calculus
zbMATH Keywords: linear logic
zbMATH Keywords: proof-net
zbMATH Keywords: sequent calculus
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1845368