Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL

Hugo Férée, Iris van der Giessen, Sam van Gool*, Ian Shillito

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

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

Original languageEnglish
Title of host publicationAutomated Reasoning - 12th International Joint Conference, IJCAR 2024, Proceedings
EditorsChristoph Benzmüller, Marijn J. H. Heule, Renate A. Schmidt
PublisherSpringer Science and Business Media Deutschland GmbH
Pages43-60
Number of pages18
ISBN (Print)9783031635007
DOIs
Publication statusPublished - 2024
Event12th International Joint Conference on Automated Reasoning, IJCAR 2024 - Nancy, France
Duration: 3 Jul 20246 Jul 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14740 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Joint Conference on Automated Reasoning, IJCAR 2024
Country/TerritoryFrance
CityNancy
Period3/07/246/07/24

Fingerprint

Dive into the research topics of 'Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL'. Together they form a unique fingerprint.

Cite this