论文标题
Kripke框架总和的满意度问题
Satisfiability problems on sums of Kripke frames
论文作者
论文摘要
我们考虑了在kripke框架上的总和，其中一个框架的家族由另一帧的元素索引。在许多情况下，总和的模态逻辑继承了有限模型属性和汇总模态逻辑的可定性性。在本文中，我们表明，在一般条件下，总和的可满足性问题是多项式空间Turing可简化为汇总的可满足问题。特别是，对于PSPACE中的许多模态逻辑性可决定性是逻辑语义表征的直接推论。
We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the finite model property and decidability from the modal logic of summands. In this paper we show that, under a general condition, the satisfiability problem on sums is polynomial space Turing reducible to the satisfiability problem on summands. In particular, for many modal logics decidability in PSPACE is an immediate corollary from the semantic characterization of the logic.
