Expressive completeness by separation for discrete time interval temporal logic with expanding modalities

被引:0
|
作者
Guelev, Dimitar P. [1 ]
Moszkowski, Ben [2 ]
机构
[1] Bulgarian Acad Sci, Inst Math & Informat, Sofia, Bulgaria
[2] Newcastle Univ, Sch Comp, Newcastle Upon Tyne, England
关键词
Expressive completeness; Interval temporal logic; Expanding modalities; Gabbay separation; Theory of computation; COMPLETE AXIOMATIZATION;
D O I
10.1016/j.ipl.2024.106480
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently we established an analog of Gabbay's separation theorem about linear temporal logic (LTL) for the extension of Moszkowski's discrete time propositional Interval Temporal Logic (ITL) by two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of ITL's chop operator. One of the many useful applications of separation in LTL is the concise proof of LTL's expressive completeness wrt the monadic first-order theory of (w, <) it enables. In this paper we show how our separation theorem about ITL facilitates a similar proof of the expressive completeness of ITL with expanding modalities wrt the monadic first- and second-order theories of (DOUBLE-STRUCK CAPITAL Z, <).
引用
收藏
页数:6
相关论文
共 33 条
  • [1] Expressive Completeness for Metric Temporal Logic
    Hunter, Paul
    Ouaknine, Joel
    Worrell, James
    [J]. 2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2013, : 349 - 357
  • [2] Expressive completeness of temporal logic of action
    Rabinovich, A
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 229 - 238
  • [3] Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction
    Demri, Stephane
    Deters, Morgan
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2016, 17 (02)
  • [4] Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
    Demri, Stephane
    Deters, Morgan
    [J]. 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,
  • [5] An expressive temporal logic for real time
    Hirshfeld, Yoram
    Rabinovich, Alexander
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 492 - 504
  • [6] An automata-theoretic completeness proof for interval temporal logic (extended abstract)
    Moszkowski, BC
    [J]. AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 223 - 234
  • [7] Weak Completeness Theorem for Propositional Linear Time Temporal Logic
    Giero, Mariusz
    [J]. FORMALIZED MATHEMATICS, 2012, 20 (03): : 227 - 234
  • [8] Completeness of a first-order temporal logic with time-gaps
    Baaz, M
    Leitsch, A
    Zach, R
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 160 (1-2) : 241 - 270
  • [9] Deciding Continuous-Time Metric Temporal Logic with Counting Modalities
    Bersani, Marcello M.
    Rossi, Matteo
    Pietro, Pierluigi San
    [J]. REACHABILITY PROBLEMS, 2013, 8169 : 70 - 82
  • [10] Detection of Mailbomb Attacks base on Time Interval Temporal Logic
    Zhou, Qinglei
    Hu, Wei
    Zhu, Weijun
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS (CICN), 2015, : 1078 - 1080