Computer Science – Logic in Computer Science
Scientific paper
2011-01-28
EPTCS 47, 2011, pp. 34-43
Computer Science
Logic in Computer Science
In Proceedings CL&C 2010, arXiv:1101.5200
Scientific paper
10.4204/EPTCS.47.5
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for superdeduction, both based on Christian Urban's work on classical sequent calculus. However the computational content of Christian Urban's calculus is not directly related to the (lambda-calculus based) Curry-Howard correspondence. In contrast the Lambda bar mu mu tilde calculus is a lambda-calculus for classical sequent calculus. This short paper is a first step towards a further exploration of the computational content of superdeduction proofs, for we extend the Lambda bar mu mu tilde calculus in order to obtain a proofterm langage together with a cut-elimination reduction for superdeduction. We also prove strong normalisation for this extension of the Lambda bar mu mu tilde calculus.
No associations
LandOfFree
Superdeduction in Lambda-Bar-Mu-Mu-Tilde does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Superdeduction in Lambda-Bar-Mu-Mu-Tilde, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superdeduction in Lambda-Bar-Mu-Mu-Tilde will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-551454