FMP for QD logics. A wrong proof

2025/07/15 by Gasquet, Olivier
#03B45 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2507.11258

Abstract

This paper initially aimed at proposing a proof that quasi-dense logics have f.m.p, but it contains a major flaw, unfixable.

Citations

• Decidability of Quasi-Dense Modal Logics
• The Finite Model Property of Quasi-transitive Modal Logic

Related

• Knocking Down Boxes: The FMP for K ⊕ \Box^m+k p → \Box^m p
• Reopening of the conjecture about the decidability of Quasi-Dense Modal Logics (Comments on Lyon & Ostropolski-Nalewaja's result)
• Every super-polynomial proof in purely implicational minimal logic has a polynomially sized proof in classical implicational propositional logic
• FPL may be equivalent to FO but not equivalent to PFP
• Justification logic enjoys the strong finite model property