A strong normalization result for classical logic

Annals of Pure and Applied Logic 76 (2):99-116 (1995)
  Copy   BIBTEX

Abstract

In this paper we give a strong normalization proof for a set of reduction rules for classical logic. These reductions, more general than the ones usually considered in literature, are inspired to the reductions of Felleisen's lambda calculus with continuations

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-01-16

Downloads
18 (#827,622)

6 months
9 (#436,568)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stefano Berardi
Università degli Studi di Torino

References found in this work

Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Mathematical significance of consistency proofs.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (2):155-182.

Add more references