Email this article The tabularity problem over the minimal logic
- Authors: Maksimova L.L.1, Yun V.F.1
-
Affiliations:
- Sobolev Institute of Mathematics, Novosibirsk State University
- Issue: Vol 57, No 6 (2016)
- Pages: 1034-1043
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/170854
- DOI: https://doi.org/10.1134/S0037446616060100
- ID: 170854
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
L. L. Maksimova
Sobolev Institute of Mathematics, Novosibirsk State University
Author for correspondence.
Email: lmaksi@math.nsc.ru
Russian Federation, Novosibirsk
V. F. Yun
Sobolev Institute of Mathematics, Novosibirsk State University
Email: lmaksi@math.nsc.ru
Russian Federation, Novosibirsk
