First order linear logic and tensor type calculus for categorial grammars

by   Sergey Slavnov, et al.

We study relationship between first order multiplicative linear logic (MLL1), which has been known to provide representations to different categorial grammars, and the recently introduced extended tensor type calculus (ETTC). We identify a fragment of MLL1, which seems sufficient for many grammar representations, and establish a correspondence between ETTC and this fragment. The system ETTC, thus, can be seen as an alternative syntax and intrinsic deductive system together with a geometric representation for the latter. We also give a natural deduction formulation of ETTC, which might be convenient.



page 1

page 2

page 3

page 4


Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...

On embedding Lambek calculus into commutative categorial grammars

Abstract categorial grammars (ACG), as well as some other, closely relat...

Pomset logic: a logical and grammatical alternative to the Lambek calculus

Thirty years ago, I introduced a non commutative variant of classical li...

Complexity of the Infinitary Lambek Calculus with Kleene Star

We consider the Lambek calculus, or non-commutative multiplicative intui...

Extracting and Learning a Dependency-Enhanced Type Lexicon for Dutch

This thesis is concerned with type-logical grammars and their practical ...

Classical linear logic, cobordisms and categorial grammars

We propose a categorial grammar based on classical multiplicative linear...

A type-assignment of linear erasure and duplication

We introduce LEM, a type-assignment system for the linear λ-calculus tha...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.