Display to Labeled Proofs and Back Again for Tense Logics

Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake, Alwen Tiu

    Research output: Contribution to journalArticlepeer-review

    2 Citations (Scopus)

    Abstract

    We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special form that is translatable to a derivation in the associated display calculus. A key insight in this converse translation is a canonical representation of display sequents as labeled polytrees. Labeled polytrees, which represent equivalence classes of display sequents modulo display postulates, also shed light on related correspondence results for tense logics.

    Original languageEnglish
    Article number3460492
    JournalACM Transactions on Computational Logic
    Volume22
    Issue number3
    DOIs
    Publication statusPublished - Jun 2021

    Fingerprint

    Dive into the research topics of 'Display to Labeled Proofs and Back Again for Tense Logics'. Together they form a unique fingerprint.

    Cite this