Explore projects
-
-
Updated
-
Updated
-
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
Updated -
Updated
-
A Novel Initial Algebra Construction Formalized in Agda
Updated -
Updated
-
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
-
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)
Updated -
Experimental Haskell implementation of lattice-valued resolution.
Updated -