scientific article; zbMATH DE number 2043517

zbMath1038.03054MaRDI QIDQ4447217

Gilles Dowek

Publication date: 16 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2706/27060002.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cut eliminationconfluenceasymmetric deductionrewriting system on terms

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42)

Related Items

Structure of proofs and the complexity of cut elimination, Some general results about proof normalization, A Completion Method to Decide Reachability in Rewrite Systems, First-order automated reasoning with theories: when deduction modulo theory meets practice, Canonical Ground Horn Theories, Regaining cut admissibility in deduction modulo using abstract completion, Automating Theories in Intuitionistic Logic