Lower and Upper Bounds for the Length of Joins in the Lambek Calculus

Автор: Sorokin Alexey
Сборник: Computer Science – Theory and Applications, 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings
Серия: Lecture Notes in Computer Science
Том: 7913
Год издания: 2013
Издательство: SPRINGER-VERLAG BERLIN
Местоположение издательства: HEIDELBERGER PLATZ 3, BERLIN, GERMANY,D-14197
Первая страница: 150
Последняя страница: 161
DOI: 10.1007/978-3-642-38536-0_13
Аннотация: In 1993 Mati Pentus proved a criterion of conjoinability for the Lambek calculus and multiplicative cyclic linear logic. In 2011 Alexey Sorokin showed that any pair of conjoinable types in the Lambek calculus has the join type of quadratic length with respect to the length of the types in the pair. We prove that the lower bound on the length of joins in the Lambek calculus and multiplicative linear logic is also quadratic.
Добавил в систему: Сорокин Алексей Андреевич

	ИСТИНА	Войти в систему Регистрация
	ИСТИНА ЦЭМИ РАН
	Главная Поиск Статистика О проекте Помощь

ИСТИНА