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

page 1

page 2

page 3

page 4

research
11/10/2019

Classical linear logic, cobordisms and categorial grammars

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

Classical linear logic, cobordisms and categorical semantics of categorial grammars

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

The Abstract Machinery of Interaction (Long Version)

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

Non-associative and projective linear logics

A non-commutative, non-associative weakening of Girard's linear logic is...
research
05/22/2023

Graphical Proof Theory I: Multiplicative Linear Logic Beyond Cographs

Cographs are a class of (undirected) graphs, characterized by the absenc...
research
06/17/2022

Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...
research
12/30/2021

Exponentially Handsome Proof Nets and Their Normalization

Handsome proof nets were introduced by Retoré as a syntax for multiplica...

Please sign up or login with your details

Forgot password? Click here to reset