Abstract
In this paper we give a proof of the strong normalisation theorem for intuitionistic type theory. Cut-elimination is an immediate consequence of it. The basic ideas of our proof are the use of wellfoundedness predicates, originally due to J. Y. Girard [1] and a mapping from the derivations in type theory into a type-free λ-calculus, which we learned in a lecture, given by W. Tait at Munich 1972.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
