A classical propositional theorem prover in Haskell, using Wang's Algorithm.
-
Updated
Jun 12, 2019 - Haskell
A classical propositional theorem prover in Haskell, using Wang's Algorithm.
Pravda is a tool for teaching formal logic.
A web-based graphical proof assistant for LK and Hoare logic.
boolean expression manipulator for educational purposes
pesca: Proof Editor for Sequent Calculus (mirror)
∇⎕ coloring
Implementation of Gentzen's Sequent Calculus (LK) applied to creating and interrogating a database in natural language
a tiny LCF-style proof assistant.
형식언어 ℒ에서 Gentzen의 추론 규칙에 따른 논증 타당성 검증기
Master Thesis Project at LARA (EPFL)
Présentation de l'article Focalisation and Classical Realizability de Guillaume Munch-Maccagnoni.
Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
Code for the "Logic, machines and sequent calculus" talk
Intuitionistic and classical propositional logic library
Equivalence of natural deduction and sequent calculus in HOL4
Add a description, image, and links to the sequent-calculus topic page so that developers can more easily learn about it.
To associate your repository with the sequent-calculus topic, visit your repo's landing page and select "manage topics."