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 条
  • [31] ORDERED LOGIC - DEFEASIBLE REASONING FOR MULTIPLE AGENTS
    GEERTS, P
    VERMEIR, D
    NUTE, D
    DECISION SUPPORT SYSTEMS, 1994, 11 (02) : 157 - 190
  • [32] Substructural Operational Semantics as Ordered Logic Programming
    Pfenning, Frank
    Simmons, Robert J.
    24TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2009, : 101 - 110
  • [33] Reason and ordered logic in Shakespeare's tragedies
    Wenzel, P
    ANGLIA-ZEITSCHRIFT FUR ENGLISCHE PHILOLOGIE, 1998, 116 (02): : 273 - 275
  • [34] Preferred answer sets for ordered logic programs
    Van Nieuwenborgh, D
    Vermeir, D
    LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 432 - 443
  • [35] Possibilistic Semantics for Logic Programs with Ordered Disjunction
    Confalonieri, Roberto
    Carlos Nieves, Juan
    Osorio, Mauricio
    Vazquez-Salceda, Javier
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, PROCEEDINGS, 2010, 5956 : 133 - +
  • [36] Efficient evaluation of a class of ordered logic programs
    Leone, N
    Pizzutit, C
    Rullo, P
    DATA & KNOWLEDGE ENGINEERING, 1997, 23 (02) : 185 - 214
  • [37] Credulous and autoepistemic reasoning using ordered logic
    Geerts, P.
    Vermeir, D.
    Logic Programming and Non-monotonic Reasoning - Proceedings, 1991,
  • [38] The logic of equilibrium and abelian lattice ordered groups
    Galli, A
    Lewin, RA
    Sagastume, M
    ARCHIVE FOR MATHEMATICAL LOGIC, 2004, 43 (02) : 141 - 158
  • [39] Dynamically ordered probabilistic choice logic programming
    De Vos, M
    Vermeir, D
    FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 227 - 239
  • [40] The logic of equilibrium and abelian lattice ordered groups
    Adriana Galli
    Renato A. Lewin
    Marta Sagastume
    Archive for Mathematical Logic, 2004, 43 : 141 - 158