scientific article
From MaRDI portal
Publication:2778822
zbMath0981.03027MaRDI QIDQ2778822
Publication date: 21 March 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2044/20440182
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)
Related Items (14)
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem ⋮ A semantical proof of the strong normalization theorem for full propositional classical natural deduction ⋮ Programming and Proving with Classical Types ⋮ Strong normalization proofs by CPS-translations ⋮ Unnamed Item ⋮ Some properties of the -calculus ⋮ Strong normalization results by translation ⋮ On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC ⋮ A short proof of the strong normalization of classical natural deduction with disjunction ⋮ Hypothetical logic of proofs ⋮ Strong normalization of classical natural deduction with disjunctions ⋮ Non-strictly positive fixed points for classical natural deduction ⋮ An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus ⋮ Counting proofs in propositional logic
This page was built for publication:
