Labelled tree sequents, Tree hypersequents and Nested (Deep) Sequents
We identify a subclass of labelled sequents called "labelled tree sequents" and show that these are notational variants of tree-hypersequents in the sense that a sequent of one type can be represented naturally as a sequent of the other type. This relationship can be extended to nested (deep) sequents using the relationship between tree-hypersequents and nested (deep) sequents, which we also show. We apply this result to transfer proof-theoretic results such as syntactic cut-admissibility...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Advances in Modal Logic Conference (AiML 2012)|
|01_Gore_Labelled_tree_sequents,_Tree_2012.pdf||196.53 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.