scientific article
From MaRDI portal
Publication:2754180
zbMath0973.03073MaRDI QIDQ2754180
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)
Related Items
Structure of proofs and the complexity of cut elimination, A resource aware semantics for a focused intuitionistic calculus, Characterising Strongly Normalising Intuitionistic Sequent Terms, Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications, Call-by-name reduction and cut-elimination in classical logic, The \(\lambda \)-calculus and the unity of structural proof theory, Strong Normalisation of Cut-Elimination That Simulates β-Reduction, Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation