Knocking Down Boxes: The FMP for $\mathbf{K} \oplus \Box^{m+k} p \to \Box^m p$

It is a long-standing open problem whether modal logics of the form $K \oplus □^{n} p \to □^{m} p$ for $n > m > 1$ have the finite model property (FMP). We solve this by showing that any modal logic axiomatized by formulas of the form $□^{n} p \to □^{m} p$ where $n > m > 1$ has the FMP.

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$

文献摘要

讨论

讲解博客

AI智能校验

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$

文献摘要

讨论

讲解博客

AI智能校验

Knocking Down Boxes: The FMP for K⊕□m+kp→□mpK⊕□m+kp→□mp

文献摘要

讨论

|讲解博客

|AI智能校验

Knocking Down Boxes: The FMP for K⊕□m+kp→□mpK⊕□m+kp→□mp

文献摘要

讨论

|讲解博客

|AI智能校验

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$

讲解博客

AI智能校验

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$

讲解博客

AI智能校验