The tabularity problem over the minimal logic

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.