Search

• < Previous
• 1
• Next >

---

Completeness for the coalgebraic cover modality

Clemens Kupke ; Alexander Kurz ; Yde Venema.

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover&nbsp;[&hellip;]

---

Strongly Complete Logics for Coalgebras

Alexander Kurz ; Jiri Rosicky.

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under&nbsp;[&hellip;]

---