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

作者：Skvortsov Dmitrij^*

来源：Journal of Logic and Computation, 2011, 21(4): 697-713.

DOI：10.1093/logcom/exp046

• Superintuitionistic predicate logics
• Kripke semantics
• recursive axiomatizability
• embeddings

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.

• 出版日期2011-8