The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ulrich Kohlenbach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ulrich Kohlenbach
    On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. [Citation Graph (0, 0)][DBLP]
    CCA, 2000, pp:119-145 [Conf]
  2. Ulrich Kohlenbach
    Proof Mining in Functional Analysis. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:233-234 [Conf]
  3. Philipp Gerhardy, Ulrich Kohlenbach
    Generalized metatheorems on the extractability of uniform bounds in functional analysis. [Citation Graph (0, 0)][DBLP]
    Mathematics, Algorithms, Proofs, 2005, pp:- [Conf]
  4. Ulrich Kohlenbach, Laurentiu Leustean
    Approximate fixed points of nonexpansive functions in product spaces. [Citation Graph (0, 0)][DBLP]
    Mathematics, Algorithms, Proofs, 2005, pp:- [Conf]
  5. Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach
    An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:192-201 [Conf]
  6. Philipp Gerhardy, Ulrich Kohlenbach
    Extracting Herbrand disjunctions by functional interpretation. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:5, pp:633-644 [Journal]
  7. Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:1-2 [Journal]
  8. Ulrich Kohlenbach
    Things That Can and Things That Cannot Be Done in PRA. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:102, n:3, pp:223-245 [Journal]
  9. Ulrich Kohlenbach
    On uniform weak König's lemma. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:114, n:1-3, pp:103-116 [Journal]
  10. Ulrich Kohlenbach
    Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:64, n:1, pp:27-94 [Journal]
  11. Ulrich Kohlenbach
    On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:95, n:1-3, pp:257-285 [Journal]
  12. Ulrich Kohlenbach, Paulo Oliva
    Proof mining in L1-approximation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:121, n:1, pp:1-38 [Journal]
  13. Philipp Gerhardy, Ulrich Kohlenbach
    Strongly uniform bounds from semi-constructive proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:1-2, pp:89-107 [Journal]
  14. Ulrich Kohlenbach
    Proof theory and computational analysis. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:13, n:, pp:- [Journal]
  15. Ulrich Kohlenbach
    A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:165, n:, pp:81-93 [Journal]
  16. Ulrich Kohlenbach
    Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:4, pp:1239-1273 [Journal]
  17. Ulrich Kohlenbach
    Relative Constructivity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:4, pp:1218-1238 [Journal]
  18. Ulrich Kohlenbach
    On The No-Counterexample Interpretation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1491-1511 [Journal]
  19. Ulrich Kohlenbach
    Intuitionistic Choice and Restricted Classical Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:455-460 [Journal]
  20. Ulrich Kohlenbach
    On Weak Markov's Principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:S1, pp:59-65 [Journal]
  21. Ulrich Kohlenbach
    A Note on Goodman's Theorem. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:1, pp:1-5 [Journal]
  22. Mircea-Dan Hernest, Ulrich Kohlenbach
    A complexity analysis of functional interpretations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:200-246 [Journal]

  23. Elimination of Skolem functions for monotone formulas in analysis. [Citation Graph (, )][DBLP]


  24. A note on Spector's quantifier-free rule of extensionality. [Citation Graph (, )][DBLP]


  25. Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. [Citation Graph (, )][DBLP]


  26. Preface. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002