In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-ca...
A development of the Mondex system was undertaken using Event-B and its associated proof tools. mental approach was used whereby the refinement between the abstract specification o...