Issues in machine-checking the decidability of implicational ticket entailment

Jeremy E. Dawson, Rajeev Goré*

*Corresponding author for this work

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

    2 Citations (Scopus)

    Abstract

    The decidability of the implicational fragment T→ of the relevance logic of ticket entailment was recently claimed independently by Bimbó and Dunn, and Padovani. We present a mechanised formalisation, in Isabelle/HOL, of the various proof-theoretical results due to Bimbó and Dunn that underpin their claim. We also discuss the issues that stymied our attempt to verify their proof of decidability.

    Original languageEnglish
    Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Proceedings
    EditorsClaudia Nalon, Renate A. Schmidt
    PublisherSpringer Verlag
    Pages347-363
    Number of pages17
    ISBN (Print)9783319669014
    DOIs
    Publication statusPublished - 2017
    Event26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017 - Brasilia, Brazil
    Duration: 25 Sept 201728 Sept 2017

    Publication series

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

    Conference

    Conference26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017
    Country/TerritoryBrazil
    CityBrasilia
    Period25/09/1728/09/17

    Fingerprint

    Dive into the research topics of 'Issues in machine-checking the decidability of implicational ticket entailment'. Together they form a unique fingerprint.

    Cite this