|
ИСТИНА |
Войти в систему Регистрация |
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logicстатья
- Автор: Pentus Mati
- Сборник: Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings
- Редактор: Адян Сергей Иванович
- Серия: Lecture Notes in Computer Science
- Том: 1234
- Год издания: 1997
- Место издания: Springer-Verlag Berlin
- Первая страница: 306
- Последняя страница: 311
- DOI: 10.1007/3-540-63045-7_31
- Аннотация: In this paper we consider two associative noncommutative analogs of Girard's linear logic. These are Abrusci's noncommutative linear logic and Yetter's cyclic linear logic. We give a linear-length translation from the multiplicative fragment of Abrusci's noncommutative linear logic into the multiplicative fragment of Yetter's cyclic linear logic and vice versa. As a corollary we obtain that the decidability problems for derivability in these two calculi are in polynomial time reducible to each other.
- Добавил в систему: Золин Евгений Евгеньевич