Weak completeness of coalgebraic dynamic logics

zbMATH Open1476.03036arXiv1509.03017MaRDI QIDQ5014445FDOQ5014445

Authors: Helle Hvid Hansen, Clemens Kupke 

Publication date: 2 December 2021

Full work available at URL: https://arxiv.org/abs/1509.03017

Recommendations

• Strong completeness for iteration-free coalgebraic dynamic logics
• Completeness for coalgebraic fixpoint logic
• Positive fragments of coalgebraic logics
• scientific article; zbMATH DE number 139632
• Iteration-free PDL with intersection: A complete axiomatization

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Categorical logic, topoi (03G30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Cites Work

• Title not available (Why is that?)
• Propositional dynamic logic of regular programs
• Universal coalgebra: A theory of systems
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• Coalgebraic semantics of modal logics: an overview
• A finite model construction for coalgebraic modal logic
• Title not available (Why is that?)
• An elementary proof of the completeness of PDL
• Game logic -- an overview
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• A recipe for state-and-effect triangles
• Algebra and Coalgebra in Computer Science
• Game logic is strong enough for parity games
• Title not available (Why is that?)
• A coalgebraic approach to linear-time logics
• Dijkstra and Hoare monads in monadic computation
• Strong completeness for iteration-free coalgebraic dynamic logics
• Strong completeness of coalgebraic modal logics

Cited In (7)

• A propositional dynamic logic for instantial neighborhood semantics
• Many-valued coalgebraic modal logic: one-step completeness and finite model property
• Strong completeness for iteration-free coalgebraic dynamic logics
• Hennessy-Milner results for probabilistic PDL
• Pooling modalities and pointwise intersection: semantics, expressivity, and dynamics
• Coalgebraic logics \& duality
• A categorical approach to coalgebraic fixpoint logic

This page was built for publication: Weak completeness of coalgebraic dynamic logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014445)