About Folding-Unfolding Cuts and Cuts Modulo

DOI10.1093/logcom/11.3.419zbMath0986.03045OpenAlexW2016428897MaRDI QIDQ2752529

Gilles Dowek

Publication date: 6 June 2002

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/beea21088ca406775faf6169c5526f36fe24d0a1

zbMATH Keywords

cut eliminationnatural deductiondeduction modulocut modulocut with a folding and an unfolding rule

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Related Items (2)

Regaining cut admissibility in deduction modulo using abstract completion ⋮ On the Convergence of Reduction-based and Model-based Methods in Proof Theory

This page was built for publication: About Folding-Unfolding Cuts and Cuts Modulo