Stable Canonical Rules and Formulas for Pre-transitive Logics via Definable Filtration

2025/10/26 by Takahashi, Tenyo · 1 citation
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2510.22638

Abstract

We generalize the theory of stable canonical rules by adopting definable filtration, a generalization of the method of filtration. We show that for a modal rule system or a modal logic that admits definable filtration, each extension is axiomatizable by stable canonical rules. Moreover, we provide an algebraic presentation of Gabbay's filtration and generalize stable canonical formulas and the axiomatization results via stable canonical formulas for K4 to pre-transitive logics \mathsfK4^m+1₁ = K + \Diamond^m+1 p → \Diamond p (m ≥ 1). As consequences, we obtain the fmp of \mathsfK4^m+1₁-stable logics and a characterization of splitting and union-splitting logics in the lattice NExt\mathsfK4^m+1₁. Finally, we introduce m-stable canonical formulas, strengthening the axiomatization results for these logics.

Citations

• Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction
• Blok-Esakia Theorems via Stable Canonical Rules

Cited by

• Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction

Related

• Pre-filtrations, Pre-stable Canonical Rules, and the Kuznetsov-Muravitsky Isomorphism
• Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction
• Blok-Esakia Theorems via Stable Canonical Rules
• On decidable extensions of Propositional Dynamic Logic with Converse
• Canonical formulas for k-potent commutative, integral, residuated\n lattices