Classical non-associative Lambek calculus (Q1850952): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classical non-associative Lambek calculus |
scientific article |
Statements
Classical non-associative Lambek calculus (English)
0 references
15 December 2002
0 references
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.
0 references
non-associative Lambek calculus
0 references
linear logic
0 references
proof-net
0 references
sequent calculus
0 references
