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
![](/img/style/loading.gif)