Craig interpolants for hybrid modal logics are computable in 4-EXPTIME when they exist, while uniform interpolant existence is undecidable.
Universal proof theory: Semi-analytic rules and craig interpolation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computation and Size of Interpolants for Hybrid Modal Logics
Craig interpolants for hybrid modal logics are computable in 4-EXPTIME when they exist, while uniform interpolant existence is undecidable.