Mechanised uniform interpolation for modal logics K, GL, and iSL

The 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...

Full description

Saved in:
Bibliographic Details
Main Authors Férée, Hugo, van der Giessen, Iris, van Gool, Sam, Shillito, Ian
Format Journal Article
LanguageEnglish
Published 16.02.2024
Subjects
Computer Science - Logic in Computer Science
Mathematics - Logic
Online AccessGet full text

Cover

More Information
Summary:The 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\"odel-L\"ob logic GL, for which our formalisation clarifies an important point in an existing, but incomplete, sequent-style proof; and (3) intuitionistic strong L\"ob 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.
DOI:10.48550/arxiv.2402.10494