Skip navigation
Skip navigation

Taming displayed tense logics using nested sequents with deep inference

Gore, Rajeev; Postniece (previously Buisman), Linda; Tiu, Alwen


We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional one-sided sequents built from multisets of formulae. Our first calculus SKt is a variant of Kashima's calculus for Kt, which can also be seen as a display calculus, and uses "shallow" inference whereby inference rules are only applied to the top-level nodes in the nested structures. The rules of SKt include certain structural rules, called "display postulates",...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
Source: Proceedings of International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2009)
DOI: 10.1007/978-3-642-02716-1_15


File Description SizeFormat Image
01_Gore_Taming_displayed_tense_logics_2009.pdf222.04 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator