261 search results - page 1 / 53 » Proof Normalization Modulo |
87
Voted
TYPES
1998
Springer
15 years 1 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
1999
Springer
15 years 1 months ago
1999
Springer
RTA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...