Tabular intermediate logics comparison

Paweł RzÄ Å¼ewski, Michał Stronkowski

Tabular intermediate logics are intermediate logics characterized by finite posets treated as Kripke frames. For a poset $\mathbb{P}$, let $L(\mathbb{P})$ denote the corresponding…