Term Rewriting and Applications

DOI10.1007/b135673zbMath1078.03046OpenAlexW2504734884MaRDI QIDQ5703867

Gilles Dowek, Benjamin Werner

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135673

zbMATH Keywords

Heyting arithmeticdeduction modulocut elimination normalization

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Grammars and rewriting systems (68Q42)

Related Items (11)

A modular construction of type theories ⋮ Unnamed Item ⋮ First-order automated reasoning with theories: when deduction modulo theory meets practice ⋮ Verificationism and Classical Realizability ⋮ Resolution is cut-free ⋮ Regaining cut admissibility in deduction modulo using abstract completion ⋮ On the expressive power of schemes ⋮ Experimenting with Deduction Modulo ⋮ Term Sequent Logic ⋮ Automating Theories in Intuitionistic Logic ⋮ On the Convergence of Reduction-based and Model-based Methods in Proof Theory

This page was built for publication: Term Rewriting and Applications