Classical non-associative Lambek calculus (Q1850952)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classical non-associative Lambek calculus |
scientific article; zbMATH DE number 1845368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classical non-associative Lambek calculus |
scientific article; zbMATH DE number 1845368 |
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
0.952979564666748
0 references
0.8519754409790039
0 references
0.8494925498962402
0 references
0.8363880515098572
0 references
0.835125207901001
0 references
