
AbstractWe develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements. Finally, we exhibit syntactic cut‐elimination theorems for all the main normal modal logics.Mathematics Subject Classification: 03B45, 03F05.
Cut-elimination and normal-form theorems, natural deduction, tree sequents, Modal logic (including the logic of norms), cut elimination, normal modal logics
Cut-elimination and normal-form theorems, natural deduction, tree sequents, Modal logic (including the logic of norms), cut elimination, normal modal logics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
