This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a first-order interpolant. This methodology is realized for lattice-based finitely-valued logics, the top element representing true. It is shown that interpolation is decidable for these logics.

中文翻译：

---

从命题插值导出的一阶插值

本文开发了一种通用的方法来连接命题和一阶插值。实际上，存在合适的调理式和Herbrand展开式以及命题插值法足以构成一阶插值法。此方法是针对基于格的有限值逻辑实现的，顶部元素表示true。结果表明，对于这些逻辑，内插是可确定的。