一句话：为 Heyting-Lewis 逻辑建立描述性框架对偶，并借经典模态翻译证明 Blok-Esakia 定理与可判定性。
Heyting-Lewis 逻辑在直觉主义命题逻辑上加入严格蕴涵连接词，其变体出现在 Haskell 风格箭头、Heyting 算术保持性逻辑、守卫（余）递归证明论以及直觉主义认知逻辑中。论文利用带二元关系的直觉主义 Kripke 框架解释严格蕴涵，定义描述性框架（Esakia 空间的推广），并建立代数语义与框架语义之间的范畴对偶。作者还改写 Wolter 与 Zakharyaschev 的变换，将 Heyting-Lewis 逻辑翻译为带两个一元算子的经典模态逻辑，由此证明 Blok-Esakia 定理，并导出已知和新的典范性、对应性定理，以及一大类 Heyting-Lewis 逻辑的有限模型性质与可判定性。
Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of this logic are surprisingly widespread: they appear as Curry-Howard correspondents of (simple type theory extended with) Haskell-style arrows, in preservativity logic of Heyting arithmetic, in the proof theory of guarded (co)recursion, and in the generalization of intuitionistic epistemic logic.Heyting-Lewis Logic can be interpreted in intuitionistic Kripke frames extended with a binary relation to account for strict implication. We use this semantics to define descriptive frames (generalisations of Esakia spaces), and establish a categorical duality between the algebraic interpretation and the frame semantics. We then adapt a transformation by Wolter and Zakharyaschev to translate Heyting-Lewis Logic to classical modal logic with two unary operators. This allows us to prove a Blok-Esakia theorem that we then use to obtain both known and new canonicity and correspondence theorems, and the finite model property and decidability for a large family of Heyting-Lewis logics.