See this document in CiteSeerX!

Proof Mining in Subsystems of Analysis (2003)  (Make Corrections)  
Paulo B. Oliva



  Home/Search   Context   Related

 
View or download:
brics.dk/DS/Ref/BR...ICSDS0312.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brics.dk/DS/Ref/BR...BRICSDSRef (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This dissertation studies the use of methods of proof theory in extracting new information from proofs in subsystems of classical analysis. We focus mainly on ine#ective proofs, i.e. proofs which make use of ine#ective principles ranging from weak Konig's lemma to full comprehension. The main contributions of the dissertation can be divided into four parts: (1) A discussion of how monotone functional interpretation provides the right notion of "numerical implication" (cf. [21]) in analysis. We ... (Update)

Similar documents (at the sentence level):
6.5%:   Proof mining in L 1 -approximation - Ulrich Kohlenbach Paulo   (Correct)
6.4%:   Effective bounds on strong unicity in L_1-approximation - Kohlenbach, Oliva (2001)   (Correct)

Active bibliography (related documents):   More   All
12.9:   Proof Mining: A Systematic Way Of Analysing Proofs In - Mathematics Ulrich Kohlenbach   (Correct)
6.8:   Proof Interpretations and the Computational Content of Proofs - Kohlenbach (2002)   (Correct)
3.9:   Proof Mining in Analysis: Computability and Complexity - Oliva (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   Information System Architecture for Secure Data Warehousing - Abello, Oliva, Samos, Saltor (2000)   (Correct)
0.2:   Proof Mining in L_1-approximation (Extended Abstract) - Kohlenbach, Oliva   (Correct)
0.1:   On Resolution Complexity of Matching Principles - Dantchev (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ oliva-proof,
  author = "Paulo B. Oliva",
  title = "Proof Mining in Subsystems of Analysis",
  url = "citeseer.ist.psu.edu/oliva03proof.html" }
Citations (may not include all citations):
951   Computational Complexity (context) - Papadimitriou - 1994  ACM
343   Introduction to Metamathematics (context) - Kleene - 1952
306   LCF considered as a programming language (context) - Plotkin - 1977
143   Foundations of Constructive Mathematics (context) - Beeson - 1985
125   Outline of a mathematical theory of computation (context) - Scott - 1970
99   Foundations of Constructive Analysis (context) - Bishop - 1967
62   Subsystems of Second Order Arithmetic (context) - Simpson - 1999
56   Feasibly constructive proofs and the propositional calculus (context) - Cook - 1975
56   Complexity Theory of Real Functions (context) - Ko - 1991  ACM
51   Functional interpretations of feasibly constructive arithmet.. (context) - Cook, Urquhart - 1993  ACM   DBLP
49   Recursive functionals and quantifiers of finite types (context) - Kleene - 1959
44   Uber eine bisher noch nicht benutzte Erweiterung des finiten.. (context) - Godel - 1958
44   the interpretation of intuitionistic number theory (context) - Kleene - 1945
42   Program extraction from normalization proofs (context) - Berger - 1993  ACM   DBLP
39   Computable Analysis (context) - Weihrauch - 2000  ACM
35   Computational complexity of real functions (context) - Ko, Friedman - 1982  DBLP
34   Classically and intuitionistically provably recursive functi.. (context) - Friedman - 1978
31   Interpretation of analysis by means of constructive function.. (context) - Kreisel - 1959
31   Countable functionals (context) - Kleene - 1959
30   Theories of finite type related to mathematical practice (context) - Feferman - 1977
28   Transactions of the American Mathematical Society (context) - Jackson, of et al. - 1921
27   Topics in Metric Fixed Point Theory (context) - Goebel, Kirk - 1990
24   Program extraction from classical proofs (context) - Berger, Schwichtenberg - 1995  ACM   DBLP
20   Mathematically strong subsystems of analysis with low rate o.. - Kohlenbach - 1996
20   Dialectica (context) - Avigad, Feferman - 1998
19   A new characterization of type-2 feasibility - Kapron, Cook - 1996  ACM   DBLP
18   Provably recursive functionals of analysis: a consistency pr.. (context) - Spector - 1962
18   volume 121 of Studies in Logic and the Foundations of Mathem.. (context) - Troelstra, van Dalen et al. - 1988
16   The polynomial hierarchy and intuitionistic bounded arithmet.. (context) - Buss - 1986  ACM   DBLP
16   Hereditarily majorizable functionals of finite type (context) - Howard - 1973
16   Analysing proofs in Analysis (context) - Kohlenbach - 1993  ACM
15   Note on the fan theorem (context) - Troelstra - 1974
14   Syntactic translations and provably recursive functions (context) - Leivant - 1985  DBLP
14   Mathematics as a numerical language (context) - Bishop - 1970
14   Arithmetizing proofs in analysis - Kohlenbach - 1998
13   Uber das Unendliche (context) - Hilbert - 1926
13   Zur intuitionistischen Arithmetik und Zahlentheorie (context) - Godel - 1933
12   the interpretation of non-finitist proofs (context) - Kreisel - 1951
12   Strongly majorizable functionals of finite type: a model for.. (context) - Bezem - 1985
12   Lazy functional algorithms for exact real functionals - Simpson - 1998  ACM   DBLP
12   Extensional Godel Functional Interpretation: A Consistency P.. (context) - Luckhardt - 1973
12   Systems of second order arithmetic with restricted induction (context) - Friedman - 1976
11   Approximation Theory (context) - Cheney - 1966  ACM
11   Annals of Pure and Applied Logic (context) - Sieg, arithmetic - 1985
11   Die Widerspruchsfreiheit der reinen Zahlentheorie (context) - Gentzen - 1936
11   The Foundations of Intuitionistic Mathematics (context) - Kleene - 1965
11   Krasnoselski-Mann iterations in normed spaces (context) - Borwein, Reich et al. - 1992
10   Computable and recursively countable functionals of higher t.. (context) - Gandy, Hyland - 1976
10   ective bounds from ine#ective proofs in analysis: an applica.. (context) - Kohlenbach - 1992
10   A quantitative version of a theorem due to BorweinReich -Sha.. - Kohlenbach - 2001
10   ective moduli of uniqueness and uniform a--priori estimates .. (context) - Kohlenbach - 1993
10   of partial continuous functionals (context) - Ershov - 1976
10   Mathematical significance of consistency proof (context) - Kreisel - 1958
10   the computational content of the axiom of choice - Berardi, Bezem et al. - 1998
9   Theory of majorizable and continuous functionals and their u.. (context) - Kohlenbach - 1990
9   Lipschitz constants and moduli of continuity for the Chebych.. (context) - Bridges - 1982
9   the computational content of the Krasnoselski and Ishikawa f.. - Kohlenbach - 2000
9   Mean value methods in iteration (context) - Mann - 1953
9   the continuity of best approximations in the space of integr.. (context) - Kroo - 1978
9   Refined program extraction from classical proofs - Berger, Schwichtenberg et al. - 2002
8   Archive for Mathematical Logic (context) - Sieg - 1991
8   the no-counterexample interpretation - Kohlenbach - 1999
8   The continuous functionals (context) - Normann - 1999
8   Error estimates and Lipschitz constants for best approximati.. (context) - Bartelt, Li - 1995
8   On weak completeness of intuitionistic predicate logic (context) - Kreisel - 1962  DBLP
7   Relative constructivity - Kohlenbach - 1998  DBLP
7   Intuitionistische Untersuchungen der formalistischen Logik (context) - Kuroda - 1951
7   Princeton University (context) - Buss, PhD - 1985
7   Totale Objekte und Mengen in der Bereichstheorie (context) - Berger - 1990
7   An elementary proof of Jackson's theorem on meanapproximatio.. (context) - Cheney - 1965
6   Iteration processes for nonexpansive mappings (context) - Goebel, Kirk - 1983
6   A constructive development of Chebychev approximation theory (context) - Bridges - 1980
6   The use of a logical principle of uniform boundedness in ana.. - Kohlenbach - 1999
6   asymptotic regularity and successive approximations (context) - Edelstein, O'Brien - 1978
6   A feasible theory for analysis - Ferreira - 1994  ACM   DBLP
6   On strong unicity of L 1 -approximation (context) - Kroo - 1981
6   Fixed points and iterations of a nonexpansive mapping in a B.. (context) - Ishikawa - 1976
6   part II: Interpretation of number theory (context) - Kreisel, interpretation et al. - 1952
6   Continuity of the metric projection operator I-III (context) - Bjornestal - 1975
6   Two remarks on the method of successive approximation (context) - Krasnoselski - 1955
6   Kreisel's unwinding of Artin's proof (context) - Delzell - 1996
5   Approximate fixed points for nonexpansive mappings in unifor.. (context) - Kirk, Martinez-Yanez - 1990
5   Studies in Proof Theory (context) - Girard, Logical - 1987
5   Sur quelques points de la logique de M (context) - Glivenko - 1929
5   Foundational and mathematical uses of higher types - Kohlenbach - 2002
5   A note on segmenting Mann iterates (context) - Groetsch - 1972
5   Transfinite induction and bar induction of types zero and on.. (context) - Howard, Kreisel - 1966
5   Nonexpansive nonlinear operators in a Banach space (context) - Browder - 1965
5   ective moduli from ine#ective uniqueness proofs (context) - Kohlenbach - 1993
5   A new method for establishing conservativity of classical sy.. - Coquand, Hofmann - 1999  ACM   DBLP
5   Nonexpansive iterations in hyperbolic spaces (context) - Reich, Shafrir - 1990  ACM
5   A model for bar recursion of higher types (context) - Scarpellini - 1971
5   Things that can and things that can't be done in PRA - Kohlenbach - 2000
5   On fixed and periodic points under contractive mappings (context) - Edelstein - 1962
5   Higher order reverse mathematics - Kohlenbach
5   Herbrand-Analysen zweier Beweise des Satzes von Roth: Polyno.. (context) - Luckhardt - 1989  DBLP
4   Mann iterates of directionally nonexpansive mappings in hype.. (context) - Kohlenbach, Leustean - 2003
4   the principle of the excluded middle (context) - Kolmogorov - 1925
4   Unwinding Program (context) - Feferman - 1996
4   the computational complexity of best L 1 -approximation (context) - Oliva - 2002
4   Hilbert's program sixty years later (context) - Sieg - 1988  DBLP
4   On bar recursion of types 0 and (context) - Schwichtenberg - 1979
3   Equivalence of bar recursors in the theory of functionals of.. (context) - Bezem - 1988
3   Local Lipschitz continuity of the metric projection operator (context) - Bjornestal - 1979
3   Some quantitative results related to Roth's theorem (context) - Bombieri, van der Poorten - 1988
3   A convexity in metric space and nonexpansive mappings (context) - Takahashi - 1970
3   Ordinal analysis of simple cases of bar recursion (context) - Howard - 1981  DBLP
3   The solution by iteration of nonlinear functional equations .. (context) - Browder, Petryshyn - 1966
3   Some theorems on Chebyche# approximation (context) - Newman, Shapiro - 1963
3   volume 811 of Lecture Notes in Mathematics (context) - Normann, the - 1980
3   A Mann interative regularization method for elliptic Cauchy .. (context) - Engl, Leitao - 2001
3   Ramsey interpreted: a parametric version of Ramsey's theorem (context) - Bellin - 1987
3   New kinds of realizability (context) - Dragalin - 1979
3   volume 93 of Cambridge Tracts in Mathematics (context) - Pinkus, -Approximation - 1989
3   The rate of asymptotic regularity is O (context) - Baillon, Bruck - 1996
3   Perspectives in Mathematical Logic (context) - Pour-El, Richards et al. - 1989
3   Polynomial-time computability in Analysis (context) - Ko - 1998
3   the uniform modulus of continuity of the operator of best ap.. (context) - Kroo - 1979
3   Fixed point iterations using infinite matrices (context) - Rhoades - 1974
3   A note on contractive mappings (context) - Rakotch - 1962
3   volume 83 of Monographs and Textbooks in Pure and Applied Ma.. (context) - Goebel, Reich et al. - 1984
2   The equivalence of the moduli of continuity of the best appr.. (context) - Angelos, Kroo - 1986
2   and almost Chebyshev subspaces of C (context) - Bartelt, Schmidt et al. - 1984
2   the computational complexity of maximization and integration (context) - Friedman - 1984
2   Intuitionistic analysis and Godel's interpretation (context) - Yasugi - 1963
2   Extensions and fixed points of contractive maps in R (context) - Bridges, Richman et al. - 1992
2   Finiteness theorems in arithmetic: an application of Herbran.. (context) - Kreisel - 1982
2   Strong unicity versus modulus of convexity (context) - Huotari, Sahab - 1994
2   Krasnoselski's iteration process in hyperbolic space (context) - Kirk - 1982
2   Nonexpansive mappings and asymptotic regularity (context) - Kirk - 2000  ACM
2   Handbook of Metric Fixed Point Theory (context) - Kirk, Sims - 2001
2   Uniform asymptotic regularity for Mann iterates (context) - Kohlenbach - 2003
2   Strongly unique best approximation in uniformly convex Banac.. (context) - Lin - 1989  ACM
2   Some logical metatheorems with applications in functional an.. (context) - Kohlenbach - 2003
2   Modified bar recursion and classical dependent choice - Berger, Oliva - 2003
2   Annals of Pure and Applied Logic (context) - Kohlenbach, Oliva et al. - 2003
2   Strongly unique best approximations and centers in uniformly.. (context) - Prus, Smarzewski - 1987
2   Proof mining: a systematic way of analysing proofs in mathem.. (context) - Kohlenbach, Oliva - 2003
2   Unique fixed points in domain theory - Martin - 2001  DBLP
2   the computational complexity of best Chebyche# approximation (context) - Ko - 1986
2   Zur Widerspruchsfreiheit der Zahlentheorie (context) - Ackermann - 1940
2   Transactions of the American Mathematical Society (context) - Clarkson, spaces - 1936
2   A complete comparison of 25 contraction conditions (context) - Collaco, Carvalho et al. - 1997  ACM
2   Local and global Lipschitz constants (context) - Angelos, Henry et al. - 1986  ACM
1   A comparison of various definitions of contractive mappings (context) - Rhoades - 1977
1   Bounds extracted by Kreisel from ine#ective proofs (context) - Luckhardt - 1996
1   Application of Proof Theory to Computational Complexity Theo.. (context) - Kau - 2001
1   A complexity analysis of functional interpretations (context) - Hernest, Kohlenbach - 2003
1   Polynomial-time algorithms from ine#ective proofs (context) - Oliva - 2003
1   A comparison of various definitions of contractive type mapp.. (context) - Meszaros - 1992
1   Contractive definitions (context) - Rhoades - 1987
1   Proof theory and computational analysis - Kohlenbach - 1998  DBLP
1   Hypotheses on algebraically closed extensions (context) - Kreisel - 1957
1   BRICS -- Basic Research in Computer Science (context) - Berger, Oliva et al. - 2002
1   Topoplogische Lineare Raume (context) - Kothe - 1960
1   Metamathematical Investigation Iintuitionistic Arithmetic an.. (context) - Troelstra - 1973
1   Review of: Intuitionistic analysis and Godel's interpretatio.. (context) - Troelstra - 1972
1   Mathematical Logic Quarterly (context) - Avigad, the et al. - 2002
1   Basic applications of weak Konig's lemma in feasible analysi.. (context) - Ferreira, Fernandes
1   Proof interpretations and the computational content of proof.. - Kohlenbach - 2003
http://www.math.tulane.edu/

Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html):   More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000)   (Correct)
Dynamic Computation - Husfeldt (1997)   (Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000)   (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