The tabularity problem over the minimal logic
- Autores: Maksimova L.1, Yun V.1
-
Afiliações:
- Sobolev Institute of Mathematics, Novosibirsk State University
- Edição: Volume 57, Nº 6 (2016)
- Páginas: 1034-1043
- Seção: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/170854
- DOI: https://doi.org/10.1134/S0037446616060100
- ID: 170854
Citar
Resumo
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.
Palavras-chave
Sobre autores
L. Maksimova
Sobolev Institute of Mathematics, Novosibirsk State University
Autor responsável pela correspondência
Email: lmaksi@math.nsc.ru
Rússia, Novosibirsk
V. Yun
Sobolev Institute of Mathematics, Novosibirsk State University
Email: lmaksi@math.nsc.ru
Rússia, Novosibirsk