A Remark on Superintuitionistic Predicate Logics of Kripke Frames with Constant and with Nested Domains

被引:1
|
作者
Skvortsov, Dmitrij [1 ]
机构
[1] All Russian Inst Sci & Tech Informat, Moscow 121351, Russia
基金
俄罗斯基础研究基金会;
关键词
Superintuitionistic predicate logics; Kripke semantics; recursive axiomatizability; embeddings;
D O I
10.1093/logcom/exp046
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The superintuitionistic predicate logics (without or with equality) of all predicate Kripke frames with nested domains over a fixed poset W (a set of possible worlds) are embeddable in the logic (without equality) of all Kripke frames with constant domains over W. Therefore, Takano's result [13] on finite axiomatizability of the logic of Kripke frames with constant domains over the set of real numbers implies the recursive axiomatizability of the corresponding logics with nested domains. Other consequences are mentioned as well.
引用
收藏
页码:697 / 713
页数:17
相关论文
共 40 条