Search

• < Previous
• 1
• Next >

---

Model Theory and Proof Theory of Coalgebraic Predicate Logic

Tadeusz Litak ; Dirk Pattinson ; Katsuhiko Sano ; Lutz Schröder.

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for several natural classes of such&nbsp;[&hellip;]

---

Unguarded Recursion on Coinductive Resumptions

Sergey Goncharov ; Lutz Schröder ; Christoph Rauch ; Julian Jakob.

We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side-effecting trees, generalizing the infinite resumption&nbsp;[&hellip;]

---

Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi

Daniel Hausmann ; Lutz Schröder.

The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-calculus includes an exponential-time upper bound&nbsp;[&hellip;]

---