- Tytuł:
- One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
- Autorzy:
- Płaczek, Paweł
- Powiązania:
- https://bibliotekanauki.pl/articles/1023344.pdf
- Data publikacji:
- 2020-11-13
- Wydawca:
- Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
- Tematy:
-
Substructural logic
Lambek calculus
nonassociative linear logic
sequent system
PTime complexity - Opis:
- Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic. Here we prove an analogous result for the nonassociative version of this logic. Like Lambek, we consider a left-sided system, but the result also holds for its right-sided version, by a natural symmetry. The treatment of nonassociative sequent systems involves some subtleties, not appearing in associative logics. We also prove the PTime complexity of the multiplicative fragment of NBL.
- Źródło:
-
Bulletin of the Section of Logic; 2021, 50, 1; 55-80
0138-0680
2449-836X - Pojawia się w:
- Bulletin of the Section of Logic
- Dostawca treści:
- Biblioteka Nauki
Artykuł