From Display to Labelled Proofs for Tense Logics

In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 120 - 139 (2013)
  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.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2019-09-20

Downloads
650 (#42,865)

6 months
118 (#50,221)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Tim Lyon
Technische Universität Dresden

References found in this work

Modal Logic: An Introduction.Brian F. Chellas - 1980 - New York: Cambridge University Press.
Saving truth from paradox.Hartry Field - 2008 - New York: Oxford University Press.
First-order logic.Raymond Merrill Smullyan - 1968 - New York [etc.]: Springer Verlag.
Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.

View all 133 references / Add more references