THE BOUNDED FRAGMENT AND HYBRID LOGIC WITH POLYADIC MODALITIES

被引：0
|
作者：
Hodkinson, Ian [1 ]
机构：
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England
来源：
REVIEW OF SYMBOLIC LOGIC | 2010年 / 3卷 / 02期
关键词：
INVARIANT FORMULAS; PERSISTENT; COMPLEXITY;
D O I：
10.1017/S1755020309990402
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We show that the bounded fragment of first-order logic and the hybrid language with 'downarrow' and 'at' operators are equally expressive even with polyadic modalities, but that their 'positive' fragments are equally expressive only for unary modalities.
引用
收藏
页码：279 / 286
页数：8
相关论文
共 50 条
  • [1] A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities
    Cerrito, Serenella
    Mayer, Marta Cialdea
    JOURNAL OF AUTOMATED REASONING, 2013, 51 (02) : 197 - 239
  • [2] A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities
    Serenella Cerrito
    Marta Cialdea Mayer
    Journal of Automated Reasoning, 2013, 51 : 197 - 239
  • [3] Symmetry in Polyadic Inductive Logic
    J. B. Paris
    A. Vencovská
    Journal of Logic, Language and Information, 2012, 21 (2) : 189 - 216
  • [4] INVARIANCE PRINCIPLES IN POLYADIC INDUCTIVE LOGIC
    Ronel, Tahel
    Vencovska, Alena
    LOGIQUE ET ANALYSE, 2014, (228) : 541 - 561
  • [5] Some Aspects of Polyadic Inductive Logic
    Jürgen Landes
    Jeff Paris
    Alena Vencovská
    Studia Logica, 2008, 90 (1) : 3 - 16
  • [6] Instantial Relevance in Polyadic Inductive Logic
    Landes, Juergen
    Paris, Jeff
    Vencovska, Alena
    LOGIC AND ITS APPLICATIONS, 2009, 5378 : 162 - 169
  • [7] A Many-sorted Polyadic Modal Logic
    Leustean, Ioana
    Moanga, Natalia
    Serbanuta, Traian Florin
    FUNDAMENTA INFORMATICAE, 2020, 173 (2-3) : 191 - 215
  • [8] Modalities and Logic
    Ivlev, Vitaly
    Lepskaya, Nellie
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON CONTEMPORARY EDUCATION, SOCIAL SCIENCES AND HUMANITIES (ICCESSH 2017), 2017, 124 : 79 - 86
  • [9] Algorithmic correspondence and completeness in modal logic. II. Polyadic and hybrid extensions of the algorithm SQEMA
    Conradie, Willem
    Goranko, Valentin
    Vakarelov, Dimiter
    JOURNAL OF LOGIC AND COMPUTATION, 2006, 16 (05) : 579 - 612
  • [10] Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
    Kaminski, Mark
    Schneider, Sigurd
    Smolka, Gert
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, PROCEEDINGS, 2009, 5607 : 235 - 249
12345