The structure of non decomposable connectives of linear logic

## Author: Roberto Maieli

## Paper Information

Title: | The structure of non decomposable connectives of linear logic |

Authors: | Roberto Maieli |

Proceedings: | Linearity/TLLA Pre-proceedings |

Editors: | Maribel Fernandez, Valeria de Paiva, Thomas Ehrhard and Lorenzo Tortora De Falco |

Keywords: | linear logic, proof nets, sequent calculus |

Abstract: | ABSTRACT. This paper studies the so-called generalized multiplicative connectives of linear logic, focusing on the question of finding the ``non-decomposable'' ones, i.e., those that may not be expressed as combinations of the default binary connectives of multiplicative linear logic, Tensor and Par. In particular, we concentrate on generalized connectives of a surprisingly simple form, called ``entangled connectives'', and prove a characterization theorem giving a criterion for identifying the decomposable (resp., undecomposable) entangled connectives. |

Pages: | 6 |

Talk: | Jul 07 14:00 (Session 28H) |

Paper: |