Cobordisms and commutative categorial grammars

07/19/2021
by   Sergey Slavnov, et al.
0

We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic proof-nets. We also introduce and study linear logic grammars, directly based on cobordisms and using classical multiplicative linear logic as a typing system.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/10/2019

Classical linear logic, cobordisms and categorial grammars

We propose a categorial grammar based on classical multiplicative linear...
10/04/2018

Classical linear logic, cobordisms and categorical semantics of categorial grammars

We propose a categorial grammar based on classical multiplicative linear...
02/13/2020

The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
01/06/2022

Non-associative and projective linear logics

A non-commutative, non-associative weakening of Girard's linear logic is...
10/04/2018

Commutative linear logic as a multiple context-free grammar

The formalism of multiple context-free grammars (MCFG) is a non-trivial ...
04/27/2018

A theory of linear typings as flows on 3-valent graphs

Building on recently established enumerative connections between lambda ...
06/17/2022

Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...
This week in AI

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