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 条
  • [31] Non-elementary lower bound for Propositional Duration Calculus
    Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
    Inf. Process. Lett., 1 (7-11):
  • [32] Non-elementary exegesis of Twardowski's theory of presentation
    Vasyukov, VL
    LVOV-WARSAW SCHOOL AND CONTEMPORARY PHILOSOPHY, 1998, 273 : 153 - 167
  • [33] Non-elementary speedups between different versions of tableaux
    Baaz, M
    Fermuller, CG
    THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 1995, 918 : 217 - 230
  • [34] Non-Elementary Complexities for Branching VASS, MELL, and Extensions
    Lazic, Ranko
    Schmitz, Sylvain
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [35] ERGODIC GEOMETRY FOR NON-ELEMENTARY RANK ONE MANIFOLDS
    Link, Gabriele
    Picaud, Jean-Claude
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2016, 36 (11) : 6257 - 6284
  • [36] Non-elementary speed-ups in default reasoning
    Egly, U
    Tompits, H
    QUALITATIVE AND QUANTITATIVE PRACTICAL REASONING, 1997, 1244 : 237 - 251
  • [37] FILTER CONVERGENCE IN NON-STANDARD ANALYSIS OF NON-ELEMENTARY FUNCTIONS
    DOPP, K
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1984, 30 (04): : 353 - 384
  • [38] A NON-ELEMENTARY PROOF BY DIFFERENTIAL EQUATION FOR THE CENTRAL LIMIT THEOREM
    Korkmaz, Adil
    Onemli, Muharrem Burak
    PAKISTAN JOURNAL OF STATISTICS, 2013, 29 (03): : 307 - 313
  • [39] C*-SIMPLICITY FOR GROUPS WITH NON-ELEMENTARY CONVERGENCE GROUP ACTIONS
    Matsuda, Yoshifumi
    Oguni, Shin-ichi
    Yamagata, Saeko
    HOUSTON JOURNAL OF MATHEMATICS, 2013, 39 (04): : 1291 - 1299
  • [40] Non-elementary speed up for model checking synchronous perfect recall
    Cohen, Mika
    Lomuscio, Alessio
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 1077 - +
12345