From Display to Labelled Proofs for Tense Logics

In Anil Nerode & Sergei Artemov (eds.), Logical Foundations of Computer Science. Springer International Publishing. pp. 120 - 139 (2018)
  Copy   BIBTEX

Abstract

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.

Author's Profile

Tim Lyon
Technische Universit├Ąt Dresden

Analytics

Added to PP
2019-09-20

Downloads
415 (#35,606)

6 months
61 (#62,296)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?