The Density of Interpolants in Modal Logic: First Results
Roman Kontchakov, Louwe Kuijer, Frank Wolter
Abstract
We initiate a quantitative study of interpolation in propositional modal logic. Instead of asking only whether a logic has Craig or uniform interpolation, we measure the density of formulas, or pairs of formulas, admitting interpolants. For quasi-normal modal logics, formulas of bounded modal depth over finite signatures are counted modulo logical equivalence. We show that interpolation failure is local to cells determined by the retained signature, yielding product decompositions of both uniform and Craig interpolation densities. These decompositions allow us to analyse their asymptotic behaviour as either the retained or the forgotten signature grows. When the retained signature grows, we obtain general results for all quasi-normal modal logics; when the forgotten signature grows, the behaviour is subtler, particularly when formulas are counted after existential quantification over forgotten variables. For locally tabular logics, we introduce cell incompatibility graphs and use them for a fine-grained analysis covering tabular logics, the difference logic Diff, and bounded-depth extensions of Grz.
Create a lesson
Related papers
Hereditary permutations for simple types revisited: A baby case for University Algebra
Thorsten Altenkirch
On the semantics of conditional branching
Fredrik Dahlqvist
Invariance and Expressiveness: Modal Variations
Martin Otto
The Necessity of Acceptance & Rejection in Inferential Reasoning
Khashayar Irani
Burnside Problems for Matrix Semigroup Quotients with Applications to Border Complexity
Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi et al.
Variational Trajectory Flow Matching with a Non-Linear Interpolant
Gurjeet Sangra Singh, Frantzeska Lavda, Alexandros Kalousis