Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents

Rajeev Goré, Björn Lellmann*

*Corresponding author for this work

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

    1 Citation (Scopus)

    Abstract

    We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the minimal amount of nesting necessary to provide an adequate proof-theory for modal logics containing converse. As a bonus, this yields a cut-free calculus for symmetric modal logic KB.

    Original languageEnglish
    Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, Proceedings
    EditorsSerenella Cerrito, Andrei Popescu
    PublisherSpringer
    Pages185-202
    Number of pages18
    ISBN (Print)9783030290252
    DOIs
    Publication statusPublished - 2019
    Event28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2019 - London, United Kingdom
    Duration: 3 Sept 20195 Sept 2019

    Publication series

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

    Conference

    Conference28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2019
    Country/TerritoryUnited Kingdom
    CityLondon
    Period3/09/195/09/19

    Fingerprint

    Dive into the research topics of 'Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents'. Together they form a unique fingerprint.

    Cite this