A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Principles of Superdeduction
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in the theory in a uniform way. Introduced ten years ago, Deduction modulo allows us to make use of the computational part of the theory Th for true computations modulo which deductions are performed. Focusing on the sequent calculus, this paper presents and studies the dual concept where the theory is used to enrich the
doi:10.1109/lics.2007.37
dblp:conf/lics/BraunerHK07
fatcat:uez7vdqlbvh3jg5272onixx3rm