Berger U., Buchholz W., and Schwichtenberg H.. Refined program extraction from classical proofs. Annals of pure and applied logic, vol. 114 (2002), pp. 3–25 [Book Review]

Bulletin of Symbolic Logic 9 (1):47-48 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Minimal from classical proofs.Helmut Schwichtenberg & Christoph Senjak - 2013 - Annals of Pure and Applied Logic 164 (6):740-748.
Proof-theoretic analysis of termination proofs.Wilfried Buchholz - 1995 - Annals of Pure and Applied Logic 75 (1-2):57-65.
System ST toward a type system for extraction and proofs of programs.Christophe Raffalli - 2003 - Annals of Pure and Applied Logic 122 (1-3):107-130.
The three dimensions of proofs.Yves Guiraud - 2006 - Annals of Pure and Applied Logic 141 (1):266-295.
Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Programs from proofs using classical dependent choice.Monika Seisenberger - 2008 - Annals of Pure and Applied Logic 153 (1-3):97-110.
An independence result for (II11-CA)+BI.Wilfried Buchholz - 1987 - Annals of Pure and Applied Logic 33 (C):131-155.
Preface.Wilfried Buchholz & Reinhard Kahle - 2005 - Annals of Pure and Applied Logic 133 (1-3):1.

Analytics

Added to PP
2014-03-22

Downloads
11 (#1,105,752)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nikki Danner
Southern Illinois University at Edwardsville

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references