arXiv (All)
open access
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 $\mathbf{K} \oplus \Box^n p \to \Box^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 $\Box^n p \to \Box^m p$ where $n>m>1$ has the FMP.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Validity in Simple Partial Logic#749123
- Truth without standard models: some conceptual problems reloaded#698433
- Types of well-founded trees and the homomorphism order#1049938
- Introducing new work on indeterminacy and underdetermination#78736
- Old and New Fallacies in Port-Royal Logic#729426
Record · ID 1116136
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive