The tabularity problem over the minimal logic
- Авторлар: Maksimova L.1, Yun V.1
-
Мекемелер:
- Sobolev Institute of Mathematics, Novosibirsk State University
- Шығарылым: Том 57, № 6 (2016)
- Беттер: 1034-1043
- Бөлім: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/170854
- DOI: https://doi.org/10.1134/S0037446616060100
- ID: 170854
Дәйексөз келтіру
Аннотация
We prove that the problem of tabularity over Johansson’s minimal logic J is decidable. Describing all pretabular extensions of the minimal logic, we find that there are seven of them and show that they are all recognizable over J. We find axiomatizations and semantic characterizations of all seven pretabular logics.
Негізгі сөздер
Авторлар туралы
L. Maksimova
Sobolev Institute of Mathematics, Novosibirsk State University
Хат алмасуға жауапты Автор.
Email: lmaksi@math.nsc.ru
Ресей, Novosibirsk
V. Yun
Sobolev Institute of Mathematics, Novosibirsk State University
Email: lmaksi@math.nsc.ru
Ресей, Novosibirsk