Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg  Home/Search
Context Related
| mathematik.unimuenchen.de/...rpe4.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mathematik.unimuenchen.de/~sc... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we develop a refined method of extracting reasonable and sometimes unexpected programs from classical proofs. (Update)
Context of citations to this paper: More
.... (but recursively enumerable) The material of the following section on Proof Mining is substantially based on [AF98] BS95] [BSBar], Bus95] Koh98a] Koh93a] Tro73] and [Tv88] 4 2 Proof Mining The general purpose of Proof Mining is to extract from a given...
.... see [100] Applications of (refined) combinations of negative translation, A translation and realizability can be found e.g. in [10] [11], 12] 105] For the interesting refinement of the A translation mentioned above see [28] and for applications of that refinement [2]...
Cited by: More
Proof Mining in Subsystems of Analysis - Oliva (2003) (Correct)
Program Extraction in simply-typed Higher Order Logic - Berghofer (2002) (Correct)
Proof Mining: A Systematic Way Of Analysing Proofs In - Mathematics Ulrich Kohlenbach (Correct)
Similar documents (at the sentence level):
23.6%: Classical Proofs and Programs - Schwichtenberg (Correct)
10.7%: Refined Program Extraction from Classical Proofs: Some Case.. - Schwichtenberg (1999) (Correct)
Active bibliography (related documents): More All
0.9: Refined Program Extraction from Classical Proofs - Berger, Buchholz.. (2001) (Correct)
0.2: Proof Mining in Analysis: Computability and Complexity - Oliva (2001) (Correct)
0.2: Higman's Lemma in Type Theory - Fridlender (1997) (Correct)
Similar documents based on text: More All
0.2: Finite Notations for Infinite Terms - Schwichtenberg (1998) (Correct)
0.2: Proof-Theoretic Analysis of Termination Proofs - Buchholz (1994) (Correct)
0.2: An Arithmetic for Non-Size-Increasing.. - Aehlig, Berger.. (Correct)
Related documents from co-citation: More All
4: Subsystems of second-order arithmetic (context) - Simpson
4: Complexity Theory of Real Functions (context) - Ko - 1991
4: Introduction to metamathematics (context) - Kleene - 1991
BibTeX entry: (Update)
Ulrich Berger, Wilfried Buchholz, and Helmut Schwichtenberg. Refined program extraction from classical proofs. In preparation, 2000. http://citeseer.ist.psu.edu/article/berger00refined.html More
@article{ berger02refined,
author = "Ulrich Berger and Wilfried Buchholz and Helmut Schwichtenberg",
title = "Refined Program Extraction from Classical Proofs",
journal = "114",
number = "1--3",
pages = "3--25",
year = "2002",
url = "citeseer.ist.psu.edu/article/berger00refined.html" }
Citations (may not include all citations):60 Extracting constructive content from classical proofs (context) - Murthy - 1990
43 Finiteness of the odd perfect and primitive abundant numbers.. (context) - Dickson - 1913
34 Classically and intuitionistically provably recursive functi.. (context) - Friedman - 1978
23 of Studies in Logic and the Foundations of Mathematics (context) - Troelstra, van Dalen et al. - 1988
19 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
14 Syntactic translations and provably recursive functions (context) - Leivant - 1985
10 Warshall Algorithm and Dickson's LemmaTwo Example Realistic .. - Helmut, Monika et al.
7 Ramsey's theorem and the pigeonhole principle in intuitionis.. (context) - Veldman, Bezem - 1992
2 Grobner Bases in Type Theory (context) - Coquand, Persson - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mathematik.uni-muenchen.de/~schwicht/): More
From Proofs to Programs in the Minlog System - The .. - Berger.. (1997) (Correct)
Finite Notations for Infinite Terms - Schwichtenberg (1998) (Correct)
From Higher Order Terms To Circuits - Schwichtenberg, Stroetmann (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC