This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful methods to prove completeness results in ‘classical’ modal logic, namely completeness-via-canonicity. This technique is particularly well-suited to a coalge...

In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal...

This note presents the Coalgebraic Class Specification Language CCSL that is developed within the LOOP project1. CCSL allows the (coalgebraic) specification of behavioral types or classes from object-oriented languages. A front-end to the theorem provers PVS [ORR+96] and ISABELLE [Pau94] compiles CCSL specifications into the logic of the theorem provers and and allows to mechanically reason abo...

This paper explains the setting of an extensive formalisation of the theory of sequences ((nite and innnite lists of elements of some data type) in the Prototype Veriication System pvs. This formalisation is based on the characterisation of sequences as a nal coalgebra, which is used as an axiom. The resulting theories comprise standard operations on sequences like composition (or concatenation...