One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
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 sys...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Lodz University Press
2021-03-01
|
| シリーズ: | Bulletin of the Section of Logic |
| 主題: | |
| オンライン･アクセス: | https://czasopisma.uni.lodz.pl/bulletin/article/view/8117 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|