Brocas-Area 发表于 2025-3-25 05:02:56
http://reply.papertrans.cn/29/2837/283633/283633_21.pnginspiration 发表于 2025-3-25 08:31:48
http://reply.papertrans.cn/29/2837/283633/283633_22.png现实 发表于 2025-3-25 15:16:04
Lutz J. Heinrich,René Riedl,Armin HeinzlThis note revisits layered logics from a coalgebraic point of view, and proposes a naturality condition to express the typical hierarchical requirement under which all abstract transitions should be traceable in more specialised layers.性满足 发表于 2025-3-25 17:25:32
Lutz J. Heinrich,René Riedl,Armin HeinzlThis work studies positive and negative introspection not as properties, but rather as actions that change the agent’s knowledge. The actions are introduced as model update operations, with matching modalities expressing their effects. Sound and complete axiom systems are provided, and some properties are explored.Definitive 发表于 2025-3-25 22:43:13
Statistical Objects in Wave TurbulenceWe review a few of the developments of dynamic logic from the author’s perspective. As implied by the title the review is not intended as a survey of the field as a whole but rather as how the author’s outlook on imperative programs and their logics evolved during the four decades up to the start of this millennium.线 发表于 2025-3-26 01:19:53
Axiomatization and Computability of a Variant of Iteration-Free , with Fork,We devote this paper to the axiomatization and the computability of .—a variant of iteration-free . with fork.Vulnerary 发表于 2025-3-26 06:22:35
http://reply.papertrans.cn/29/2837/283633/283633_27.png良心 发表于 2025-3-26 09:29:16
http://reply.papertrans.cn/29/2837/283633/283633_28.pngGENRE 发表于 2025-3-26 14:25:19
Dynamic Logic: A Personal Perspective,We review a few of the developments of dynamic logic from the author’s perspective. As implied by the title the review is not intended as a survey of the field as a whole but rather as how the author’s outlook on imperative programs and their logics evolved during the four decades up to the start of this millennium.自制 发表于 2025-3-26 19:44:04
Undecidability of Relation-Changing Modal Logics,obally. We investigate the satisfiability problem of these logics. We define satisfiability-preserving translations from an undecidable memory logic to relation-changing modal logics. This way we show that their satisfiability problems are undecidable.