Sciweavers

1818 search results - page 6 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
RTA
2010
Springer
15 years 3 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
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 ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
LOGCOM
2010
124views more  LOGCOM 2010»
14 years 10 months ago
Analytic Methods for the Logic of Proofs
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...
Marcelo Finger
RTA
1999
Springer
15 years 4 months ago
On the Strong Normalisation of Natural Deduction with Permutation-Conversions
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...
Philippe de Groote
ECAI
1994
Springer
15 years 3 months ago
Reusing Proofs
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...
Thomas Kolbe, Christoph Walther
FAC
2008
107views more  FAC 2008»
14 years 11 months ago
An incremental development of the Mondex system in Event-B
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...
Michael Butler, Divakar Yadav