科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we establish the first-order definability of sequents with consistent variable occurrence on bi-approximation semantics by means of the Sahlqvist-van Benthem algorithm. Then together with the canonicity results in Suzuki (2011), this allows us to establish a Sahlqvist theorem for substructural logic. Our result is not limited to substructural logic but is also easily applicable to other lattice-based logics.
- 出版日期2013-6
