Abstract
AbstractThe uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal logics, namely: (1) the modal logic K, for which a pen-and-paper proof exists; (2) Gödel-Löb logic GL, for which our formalisation clarifies an important point in an existing, but incomplete, sequent-style proof; and (3) intuitionistic strong Löb logic iSL, for which this is the first proof-theoretic construction of uniform interpolants. Our work also yields verified programs that allow one to compute the propositional quantifiers on any formula in this logic.
Publisher
Springer Nature Switzerland
Reference28 articles.
1. D’Agostino, G., Hollenberg, M.: Logical questions concerning the $$\upmu $$-calculus: interpolation. Lyndon and Łoś-Tarski. J. Symbolic Logic 65(1), 310–332 (2000). https://doi.org/10.2307/2586539
2. Alizadeh, M., Derakhshan, F., Ono, H.: Uniform interpolation in substructural logics. Rev. Symbol. Logic 7(3), 455–483 (2014). https://doi.org/10.1017/S175502031400015X
3. Bílková, M.: Interpolation in modal logics. Ph.D. thesis, Univerzita Karlova, Prague (2006)
4. Bílková, M.: Uniform interpolation and propositional quantifiers in modal logics. Studia Logica: Int. J. Symbol. Logic 85(1), 1–31 (2007). http://www.jstor.org/stable/40210757
5. Bílková, M.: Uniform interpolation in provability logics (2022). https://arxiv.org/pdf/2211.02591.pdf