GitHub - RBornat/jape: Jape, a configurable proof editor ...
https://github.com/RBornat/jape03.01.2022 · Jape. Jape is a configurable proof calculator and supports the interactive discovery of formal proofs in inference systems. It is distributed with a number of example logic encodings: in particular a natural deduction, several sequent calculi, a treatment of Burroughs-Abadi-Newman protocols, a Hindley-Milner typing mechanism, and various others including even Aristotlean …
Logitext
logitext.mit.eduLogitext is an educational proof assistant for first-order classical logic using the sequent calculus, in the same tradition as Jape, Pandora, Panda and Yoda.It is intended to assist students who are learning Gentzen trees as a way of structuring derivations of logical statements. Underneath the hood, Logitext interfaces with Coq in order to check the validity of your proof steps.
Introduction to Sequent Calculus
www3.risc.jku.at › education › coursesOct 25, 2019 · If we combine pictorially all proof steps, then we obtain the proof tree pre-sented in Fig. 1. Formally, a proof tree is a graph having as nodes the proof situations and as arcs the proof steps. The root is the initial proof situation and the leaves are the nal proof situations. 2.4 Inference Rules Each step of the proof follows a certain rule.
Logitext
logitext.mit.eduLogitext is an educational proof assistant for first-order classical logic using the sequent calculus, in the same tradition as Jape, Pandora, Panda and Yoda.It is intended to assist students who are learning Gentzen trees as a way of structuring derivations of logical statements.
Sequent Calculus Primer - Sakharov
sakharov.net/sequent.htmlSequent calculus is is a convenient tool for for designing algorithms conducting proof search. Infereence rules can be used backward for this purpose. To prove a formula F, one can start from sequent |- F and proceed upward from level to level. For each sequent, the sequents of the next level above this sequents can be effectively determined.