On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call "shallow calculi", where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima's calculus for tense logic and share an essential characteristic with display calculi, namely, the presence of...[Show more]
|Collections||ANU Research Publications|
|Source:||Logical Methods in Computer Science|
|DOI:||10.2168/LMCS-7 (2:8) 2011|
|01_Gore_On_the_correspondence_between_2011.pdf||381.24 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.