MOSS' LOGIC FOR ORDERED COALGEBRAS

被引:0
|
作者
Bilkova, Marta [1 ,2 ]
Dostal, Matej [3 ]
机构
[1] Czech Acad Sci, Inst Comp Sci, Prague, Czech Republic
[2] Charles Univ Prague, Fac Arts, Prague, Czech Republic
[3] Czech Tech Univ, Fac Elect Engn, Prague, Czech Republic
关键词
MODAL LOGIC;
D O I
10.46298/LMCS-18(3:18)2022
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a finitary version of Moss' coalgebraic logic for T-coalgebras, where T is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least finitary subfunctor of the dual of the coalgebra functor T-omega(partial derivative) , and the semantics of the modality is given by relation lifting. For the semantics to work, T is required to preserve exact squares. For the finitary setting to work, T-omega(partial derivative) is required to preserve finite intersections. We develop a notion of a base for subobjects of T omega X. This in particular allows us to talk about the finite poset of subformulas for a given formula. The notion of a base is introduced generally for a category equipped with a suitable factorisation system. We prove that the resulting logic has the Hennessy-Milner property for the notion of similarity based on the notion of relation lifting. We define a sequent proof system for the logic, and prove its completeness.
引用
收藏
页码:1 / 18
页数:61
相关论文
共 50 条
  • [21] A universal fixpoint semantics for ordered logic
    Laenens, E
    Vermeir, D
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 2000, 19 (03): : 221 - 254
  • [22] Semantics and expressiveness of disjunctive ordered logic
    Francesco Buccafurri
    Nicola Leone
    Pasquale Rullo
    Annals of Mathematics and Artificial Intelligence, 1999, 25 : 311 - 337
  • [23] Temporal logic of linearly ordered α-spaces
    V. F. Murzina
    Algebra and Logic, 2008, 47 : 405 - 419
  • [24] Ordered completion for logic programs with aggregates
    Asuncion, Vernon
    Chen, Yin
    Zhang, Yan
    Zhou, Yi
    ARTIFICIAL INTELLIGENCE, 2015, 224 : 72 - 102
  • [25] Semantics and expressiveness of disjunctive ordered logic
    Buccafurri, F
    Leone, N
    Rullo, P
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 25 (3-4) : 311 - 337
  • [26] Ordered belief fusion in possibilistic logic
    Liau, CJ
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, PT 1, PROCEEDINGS, 2005, 3641 : 632 - 641
  • [27] Forgetting in logic programs with ordered disjunction
    Chen, Wu
    Fo, Norman
    Zhang, Mingyi
    AI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4830 : 254 - +
  • [28] Categorical abstract algebraic logic: Ordered equational logic and algebraizable PoVarieties
    Voutsadakis, George
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2006, 23 (04): : 297 - 319
  • [29] Categorical Abstract Algebraic Logic: Ordered Equational Logic and Algebraizable PoVarieties
    George Voutsadakis
    Order, 2006, 23 : 297 - 319
  • [30] Jordan (super)coalgebras and lie (super) coalgebras
    Zhelyabin, VN
    SIBERIAN MATHEMATICAL JOURNAL, 2003, 44 (01) : 73 - 92