Tabular Logics with no Finite Bases for Inference Rules
Vladimir Vladimirovich Rybakov · Logic Journal of IGPL · 2004
We find an example of a rooted, finite, partially ordered set Q9 such that the superintuitionistic logic L(Q9) generated by Q9 has no finite bases for admissible inference rules. The modal logic based on Q9 also has the same property.