Machine-checked interpolation theorems for substructural logics using display calculi

Jeremy E. Dawson*, James Brotherston, Rajeev Goré

*Corresponding author for this work

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

    Abstract

    We present a mechanised formalisation, in Isabelle/HOL, of Brotherston and Goré’s proof of Craig interpolation for a large of class display calculi for various propositional substructural logics. Along the way, we discuss the particular difficulties associated with the local interpolation property for various rules, and some important differences between our proofs and those of Brotherston and Goré, which are motivated by the ease of mechanising the development. Finally, we discuss the value for this work of using a prover with a programmable user interface (here, Isabelle with its Standard ML interface).

    Original languageEnglish
    Title of host publicationAutomated Reasoning - 8th International Joint Conference, IJCAR 2016, Proceedings
    EditorsNicola Olivetti, Ashish Tiwari
    PublisherSpringer Verlag
    Pages452-468
    Number of pages17
    ISBN (Print)9783319402284
    DOIs
    Publication statusPublished - 2016
    Event8th International Joint Conference on Automated Reasoning, IJCAR 2016 - Coimbra, Portugal
    Duration: 27 Jun 20162 Jul 2016

    Publication series

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

    Conference

    Conference8th International Joint Conference on Automated Reasoning, IJCAR 2016
    Country/TerritoryPortugal
    CityCoimbra
    Period27/06/162/07/16

    Fingerprint

    Dive into the research topics of 'Machine-checked interpolation theorems for substructural logics using display calculi'. Together they form a unique fingerprint.

    Cite this