Strong Completeness and Limited Canonicity for PDL

被引：0
|
作者：
Gerard Renardel de Lavalette
Barteld Kooi
Rineke Verbrugge
机构：
[1] University of Groningen,Department of Computing Science
[2] University of Groningen,Faculty of Philosophy
[3] University of Groningen,Department of Artificial Intelligence
来源：
Journal of Logic, Language and Information | 2009年 / 18卷 / 2期
关键词：
D O I：
10.1007/s10849-009-9083-z
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：291 / 292
页数：1
相关论文
共 50 条
  • [41] Strong Completeness Theorems for Weak Logics of Common Belief
    Luc Lismont
    Philippe Mongin
    Journal of Philosophical Logic, 2003, 32 : 115 - 137
  • [42] A strong completeness theorem in intuitionistic quantified modal logic
    Hengshan Gao
    Science in China Series E: Technological Sciences, 2000, 43 : 60 - 70
  • [43] Strong standard completeness for continuous t-norms
    Kulacka, Agnieszka
    FUZZY SETS AND SYSTEMS, 2018, 345 : 139 - 150
  • [44] Strong Soundness-Completeness Theorem: A Semantic Approach
    Alfredo Amor, Jose
    TEOREMA, 2009, 28 (03): : 173 - 190
  • [45] A strong completeness theorem in intuitionistic quantified modal logic
    Gao, HS
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2000, 43 (01): : 60 - 70
  • [46] The formal strong completeness of partial monoidal Boolean BI
    Larchey-Wendling, Dominique
    JOURNAL OF LOGIC AND COMPUTATION, 2016, 26 (02) : 605 - 640
  • [47] Strong non-standard completeness for fuzzy logics
    Tommaso Flaminio
    Soft Computing, 2008, 12 : 321 - 333
  • [48] STRONG CONSERVATIVITY AND COMPLETENESS FOR FRAGMENTS OF INFINITARY ACTION LOGIC
    Kuznetsov, S. L.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2024, 21 (02): : 789 - 809
  • [49] Lazy narrowing: Strong completeness and eager variable elimination
    Middeldorp, A
    Okui, S
    Ida, T
    THEORETICAL COMPUTER SCIENCE, 1996, 167 (1-2) : 95 - 130
  • [50] Strong NP-completeness of a matrix similarity problem
    Brimkov, V
    Codenotti, B
    Leoncini, M
    Resta, G
    THEORETICAL COMPUTER SCIENCE, 1996, 165 (02) : 483 - 490
12345