IANDC
2010
13 years 2 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
CORR
2008
Springer
13 years 2 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
TYPES
1998
Springer
13 years 8 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
RTA
2005
Springer
13 years 9 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
TLCA
2007
Springer
13 years 10 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
LFCS
2007
Springer
13 years 10 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
LICS
2007
IEEE
13 years 10 months ago
2007
IEEE
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 t...
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
CADE
2004
Springer
14 years 4 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...