Knocking Down Boxes: The FMP for K m+k p m p
Abstract
It is a long-standing open problem whether modal logics of the form K n p 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 m p where n>m>1 has the FMP.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.