A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic

Caitlin D’Abrera, Jeremy Dawson*, Rajeev Goré

*Corresponding author for this work

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

    3 Citations (Scopus)

    Abstract

    We port Dawson and Goré’s general framework of deep embeddings of derivability from Isabelle to Coq. By using lists instead of multisets to encode sequents, we enable the encoding of genuinely substructural logics in which some combination of exchange, weakening and contraction are not admissible. We then show how to extend the framework to encode the linear nested sequent calculus LNSKt of Goré and Lellmann for the tense logic Kt and prove cut-elimination and all required proof-theoretic theorems in Coq, based on their pen-and-paper proofs. Finally, we extract the proof of the cut-elimination theorem to obtain a formally verified Haskell program that produces cut-free derivations from those with cut. We believe it is the first published formally verified computer program for eliminating cuts in any proof calculus.

    Original languageEnglish
    Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 30th International Conference, TABLEAUX 2021, Proceedings
    EditorsAnupam Das, Sara Negri
    PublisherSpringer Science and Business Media Deutschland GmbH
    Pages281-298
    Number of pages18
    ISBN (Print)9783030860585
    DOIs
    Publication statusPublished - 2021
    Event30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2021, co-located with the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021 - Birmingham, United Kingdom
    Duration: 6 Sept 20219 Sept 2021

    Publication series

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

    Conference

    Conference30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2021, co-located with the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021
    Country/TerritoryUnited Kingdom
    CityBirmingham
    Period6/09/219/09/21

    Fingerprint

    Dive into the research topics of 'A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic'. Together they form a unique fingerprint.

    Cite this