A generic reasoner for modal and hybrid logics; it can be instantiated to any modal or hybrid logic admitting an axiomatization in terms of so-called rank-1 rules or axioms

A Coq formalization of the HM logic of open bisimulations in pi-calculus, developed originally by Frederik Haselmeier’s as a part of his MSc thesis with a specific take on the locally nameless approach (called $LN_\pi$ by Frederik)

The Coalgebraic Partition Refiner

The Episciences Remote Control tool for episciences journals like LMCS

Experimental Haskell implementation of lattice-valued resolution.

CORQUE stands for CORecursive eQUations over Effects. This project contains a Coq formalization of complete Elgot monads, their corecursive extensions and background proofs for the paper Unguarded Recursion on Coinductive Resumptions...

Transform bounded self-reference into plain owl files

Template for Bachelor, Master, and Project Theses

MDP minimization tool from Antti Valmari

BSc project of Michael Banken on simulating counter machines

This is a formalisation of Wim Ruitenburg's paper "On the Period of Sequences (An(p)) in Intuitionistic Propositional Calculus" (JSL 1984).

Paul Wild's development of Aarhus ModuRes library

A train shunting simulation for the browser.