On Constructive Cut Admissibility in Deduction Modulo
From MaRDI portal
Publication:3612434
DOI10.1007/978-3-540-74464-1_3zbMath1178.03021MaRDI QIDQ3612434
Richard Bonichon, Olivier Hermant
Publication date: 10 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74464-1_3
03B35: Mechanization of proofs and logical operations
03F05: Cut-elimination and normal-form theorems
03B20: Subsystems of classical logic (including intuitionistic logic)
Related Items
Resolution is cut-free, First-order automated reasoning with theories: when deduction modulo theory meets practice, Automating Theories in Intuitionistic Logic