|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ЦЭМИ РАН |
||
A Uniform Formalisation of Three-Valued Logics in Bisequent Calculusстатья
- Авторы: Indrzejczak Andrzej, Petrukhin Yaroslav
- Сборник: Automated Deduction – CADE 29
- Серия: Springer Lecture Notes in Computer Science
- Том: 14132
- Год издания: 2023
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 325
- Последняя страница: 343
- DOI: 10.1007/978-3-031-38499-8_19
- Аннотация: We present a uniform characterisation of three-valued logics by means of bisequent calculus (BSC). It is a generalised form of sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as the weakest kind of system in the rich family of generalised SC operating on items being some collections of ordinary sequents. This family covers several forms of hypersequent and nested sequent calculi introduced to provide decent SC for several non-classical logics. It seems that for many non-classical logics, including some many-valued, paraconsistent and modal logics, this reasonably modest generalization of standard SC is sufficient. In this paper we examine a variety of three-valued logics and show how they can be formalised in the framework of bisequent calculus. All provided systems are cut-free and satisfy the subformula property. Also the interpolation theorem is constructively proved for some logics.
- Добавил в систему: Петрухин Ярослав Игоревич