Explore projects

A generic reasoner for modal and hybrid logics; it can be instantiated to any modal or hybrid logic admitting an axiomatization in terms of socalled rank1 rules or axioms
Updated 

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

Updated

Updated

Updated

Updated

Updated

Updated

Updated


A Coq formalization of the HM logic of open bisimulations in picalculus, 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)
Updated 
Experimental Haskell implementation of latticevalued resolution.
Updated 

Updated

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...
Updated 
Updated