Normalization theorems for full first order classical natural deduction

Publisher: Cambridge University Press

E-ISSN: 1943-5886|56|1|129-149

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.56, Iss.1, 1991-03, pp. : 129-149

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this paper we prove the strong normalization theorem for full first order classical N.D. (natural deduction)—full in the sense that all logical constants are taken as primitive. We also give a syntactic proof of the normal form theorem and (weak) normalization for the same system.