(Enter summary)
Abstract: In this paper, we provide a general setting under which results
of normalization of proof trees such, for instance, as the logicality
result in equational reasoning and the cut elimination property in sequent
or deduction natural calculi, can be modeled, understood, studied,
proven and generalized. This is achieved by giving simple conditions on
logic calculi which are sucient to ensure that such normalization results
hold. These conditions are based on basic properties of elementary... (Update)
Cited by: More
Structures for rewriting - Marc Aiguier Universit
(Correct)
Active bibliography (related documents): More All
1.9: On Generalized Theorems for . . . - Aiguier, Boin, Longuet
(Correct)
0.5: Generating an Action Notation Environment from.. - Anlauff.. (2001)
(Correct)
0.5: What is a Theory? - Dowek
(Correct)
Similar documents based on text:
5.0: Unknown -
(Correct)
BibTeX entry: (Update)
M. Aiguier, C. Boin, and D. Longuet. On generalized theorems for normalization of proof trees. Technical report, LaMI, University of Evry vald 'Essonne, 2005. http://citeseer.ist.psu.edu/aiguier05generalized.html More
@misc{ aiguier05generalized,
author = "M. Aiguier and C. Boin and D. Longuet",
title = "On generalized theorems for normalization of proof trees",
text = "M. Aiguier, C. Boin, and D. Longuet. On generalized theorems for normalization
of proof trees. Technical report, LaMI, University of Evry vald 'Essonne,
2005.",
year = "2005",
url = "citeseer.ist.psu.edu/aiguier05generalized.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
353
Term Rewriting and All That (context) - Baader, Nipkow - 1998
343
Introduction to Meta-mathematics (context) - Kleene - 1952
167
Natural deduction: A proof-theoretical study (context) - Prawitz - 1965
97
Automated Deduction for Non Classical Logics (context) - Wallen - 1990
53
Journal of Philosophical Logic (context) - Belnap - 1982
43
Theoretical Computer Science (context) - Kaplan, rules - 1984
42
The coq proof assistant reference manual
- Cornes, Courant et al. - 1995
32
the structure of abstract algebras (context) - Birkho - 1935
22
Proof normalization modulo
- Dowek, Werner - 1999
21
Bi-rewrite systems
- Levy, Agusti - 1996
21
Normal derivability in classical logic (context) - Tait - 1989
7
a generalised logicality theorem
- Aiguier, Bahrami et al. - 2002
5
English translation in M (context) - Gentzen, das et al. - 1969
4
On Specifying and Reasoning with Special Relations (context) - Schorlemmer - 1999
3
A new machine-checked proof of strong normalisation for disp..
- Dawson, Gore - 2003
3
Term rewriting for normalization by evaluation
- Berger, Eberl - 2003
3
Non-symmetric rewriting
- Struth - 1996
2
volume Foundations of Automatic Theorem Proving (context) - Gallier, Computer - 1986
2
Uni ed algebras and modules (context) - Mosses - 1989
2
Con uence as a cut elimination property (context) - Dowek - 2003
1
Logicality of conditional of conditional rewrite systems (context) - Yamada, Avenhaus et al. - 2000
http://isabelle.in.tum.de/doc/logics-HOL.pdf
www.phil.uu.nl/oostrom/publication/rewriting.html
Documents on the same site (http://www.ibisc.univ-evry.fr/~aiguier/documents/publications/): More
Testing from Algebraic Specifications: Test Data.. - Aiguier, Arnould, .. (2005)
(Correct)
Stratified institutions and elementary homomorphisms - Aiguier, Diaconescu
(Correct)
An algebraic approach for Codesign - Aiguier, Beroff, Schobbens (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC