A direct proof of strong normalization for full constructive second-order logic
type: Item
instance of: scholarly article
title: A direct proof of strong normalization for full constructive second-order logic
zbMATH Open document ID: 1069.03005
author: Pimpen Vejjajiva
published in: Southeast Asian Bulletin of Mathematics
publication date: 2005-03-21T00:00:00Z
Mathematics Subject Classification ID: 03B15
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 2148380
zbMATH Keywords: program extraction
zbMATH Keywords: Curry-Howard terms
zbMATH Keywords: second-order logic
zbMATH Keywords: strong normalization theorem
MaRDI profile type: Publication
Recommended article: Proofs of strong normalisation for second order classical natural deduction
Recommended article: Strong normalization property for second order linear logic
Recommended article: Strong normalization of a symmetric lambda calculus for second-order classical logic
Recommended article: Strong normalization proof with CPS-translation for second order classical natural deduction
Recommended article: A strong normalization result for classical logic
Recommended article: A semantical proof of the strong normalization theorem for full propositional classical natural deduction
Recommended article: On strong normalization in proof-graphs for propositional logic
Recommended article: Q5015364
Recommended article: Q4525289
Recommended article: Q4938598
description: scientific article; zbMATH DE number 2148380