TL;DR
GenZ is introduced, a generic theorem prover for sequent calculi implemented in Haskell that allows the user to specify a set of sequent rules, over which it performs proof search, and employs the zipper data structure.
This paper provides an expository comparison of two foundational proof systems in classical propositional logic: Gentzen's sequent calculus and Beth's semantic tableaux. Gentzen's sequent calculus is presented as a rule-based system built upon the single axiom $\alpha \Rightarrow \alpha$, whose key feature — the subfor...
We present an abstract framework for conservation and translation theorems between logical calculi. Unlike previous approaches, our setting does not require the underlying consequence relations to satisfy structural properties such as cut, allowing in particular for cut-free calculi. Moreover, we study translations bet...
This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...
The resulting prototype reconstructs about 80% of generated proof steps automatically, making Leo-III the first higher-order automated theorem prover to support independently checkable proof reconstruction and providing a basis for cross-system reuse.
This work is a continuation, and generalization, of Andrew Appel's landmark work on “Compiling with Continuations”, but instead of natural-deduction-based languages like the lambda calculus, it uses sequent-calculus-inspired languages throughout all intermediate stages.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
