A Semantical View of Proof Systems.
Lecture Notes in Computer Science(2018)
摘要
In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a semantical characterisation of intuitionistic, normal and non-normal modal logics for all these systems, via a case-by-case translation between labelled nested to labelled sequent systems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络