A direct proof of strong normalization for full constructive second-order logic

zbMath1069.03005MaRDI QIDQ1769440

Pimpen Vejjajiva

Publication date: 21 March 2005

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

second-order logicprogram extractionstrong normalization theoremCurry-Howard terms

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Extended Curry-Howard terms for second-order logic

This page was built for publication: A direct proof of strong normalization for full constructive second-order logic