Completeness and incompleteness in nominal Kleene algebra

被引:2
|
作者
Kozen, Dexter [1 ]
Mamouras, Konstantinos [2 ]
Silva, Alexandra [3 ]
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[2] Univ Penn, CIS Dept, Philadelphia, PA 19104 USA
[3] UCL, Dept Comp Sci, London WC1E 6BT, England
基金
美国国家科学基金会;
关键词
Kleene algebra; Nominal sets; Programming logic;
D O I
10.1016/j.jlamp.2017.06.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with statically scoped allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization that captures the behavior of the scoping operator and its interaction with the Kleene algebra operators and proved soundness over nominal languages. In this paper, we show that the axioms proposed by Gabbay and Ciancia are not complete over the semantic interpretation they propose. We then identify a slightly wider class of language models over which they are sound and complete. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:17 / 32
页数:16
相关论文
共 50 条
  • [41] Monodic tree kleene algebra
    Takai, Toshinori
    Furusawa, Hitoshi
    RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2006, 4136 : 402 - 416
  • [42] Proof theory for Kleene algebra
    Hardin, C
    LICS 2005: 20TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE - PROCEEDINGS, 2005, : 290 - 299
  • [43] Probabilistic Concurrent Kleene Algebra
    McIver, Annabelle
    Rabehaja, Tahiry
    Struth, Georg
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (117): : 97 - 115
  • [44] On the Complexity of Kleene Algebra with Domain
    Sedlar, Igor
    RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE, RAMICS 2023, 2023, 13896 : 208 - 223
  • [45] Kleene Algebra Modulo Theories
    Greenberg, Michael
    Beckett, Ryan
    Campbell, Eric
    PROCEEDINGS OF THE 43RD ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '22), 2022, : 594 - 608
  • [46] TOWARDS KLEENE ALGEBRA WITH RECURSION
    LEISS, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 242 - 256
  • [47] Termination in modal Kleene algebra
    Desharnais, J
    Möller, B
    Struth, G
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 647 - 660
  • [48] On the complexity of reasoning in Kleene algebra
    Kozen, D
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 195 - 202
  • [49] COMBINED APPLICATIONS OF INCOMPLETENESS AND COMPLETENESS THEOREMS
    MCALOON, K
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1975, 280 (13): : 849 - 852
  • [50] Foundations of Logic: Completeness, Incompleteness, Computability
    Salehi, Saeed
    TEACHING PHILOSOPHY, 2024, 47 (03) : 460 - 463