An elementary construction for a non-elementary procedure

被引：2
|
作者：
Marx M. [1 ]
Mikulás S. [2 ]
机构：
[1] Language and Inference Technology Group, ILLC, Universiteit Van Amsterdam, 1018 WV Amsterdam
[2] School of Computer Science and Information Systems, Birkbeck College, University of London, London WC1E 7HX, Malet Street
来源：
Studia Logica | 2002年 / 72卷 / 2期
关键词：
Decidability; Finite model property; Modal logic; Product of modal logics;
D O I：
10.1023/A:1021312628326
中图分类号：
学科分类号：
摘要：
We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for the product finite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, reflexivity and symmetry. We do not consider the transitivity condition in isolation because it leads to infinity axioms when taking products. © 2002 Kluwer Academic Publishers.
引用
收藏
页码：253 / 263
页数：10
相关论文
共 50 条
12345