DeepAI AI Chat
Log In Sign Up

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages

by   Ulrich Dorsch, et al.

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type theorem establishing a correspondence between our expressions and finite systems. Our expression language is similar to one introduced in previous work by Myers but has a semantics defined in terms of a particular form of predicate liftings as used in coalgebraic modal logic; in fact, our expressions can be regarded as a particular type of modal fixed point formulas. The predicate liftings in question are required to satisfy a natural preservation property; we show that this property holds in particular for the Moss liftings introduced by Marti and Venema in work on lax extensions.


page 1

page 2

page 3

page 4


Finite Model Property of Pretransitive Modal Logic

The finite model property of the pretransitive modal logic K_2,3=K⊕ p→ p...

Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions

Milner (1984) introduced a process semantics for regular expressions as ...

Languages with Decidable Learning: A Meta-theorem

We study expression learning problems with syntactic restrictions and in...

A Sahlqvist-style Correspondence Theorem for Linear-time Temporal Logic

The language of modal logic is capable of expressing first-order conditi...

Probabilistic logics based on Riesz spaces

We introduce a novel real-valued endogenous logic for expressing propert...

Extending Functional Languages with High-Level Exception Handling

We extend functional languages with high-level exception handling. To be...

lr-Multisemigroups and Modal Convolution Algebras

We show how modal quantales arise as convolution algebras of functions f...