default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Kohlenbach
Person information
- affiliation: Technische Universität Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Ulrich Kohlenbach:
Applied Proof Theory - Proof Interpretations and their Use in Mathematics. Springer Monographs in Mathematics, Springer 2008, ISBN 978-3-540-77532-4, pp. I-XIX, 1-532
Journal Articles
- 2023
- [j48]Horatiu Cheval, Ulrich Kohlenbach, Laurentiu Leustean
:
On Modified Halpern and Tikhonov-Mann Iterations. J. Optim. Theory Appl. 197(1): 233-251 (2023) - 2022
- [j47]Nicholas Pischke, Ulrich Kohlenbach:
Quantitative analysis of a subgradient-type method for equilibrium problems. Numer. Algorithms 90(1): 197-219 (2022) - [j46]Nicholas Pischke, Ulrich Kohlenbach:
Correction to: Quantitative analysis of a subgradient-type method for equilibrium problems. Numer. Algorithms 90(1): 221 (2022) - [j45]Ulrich Kohlenbach:
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space. Optim. Lett. 16(2): 611-621 (2022) - 2021
- [j44]Ulrich Kohlenbach:
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine-Borel compactness. Arch. Math. Log. 60(7): 995-1003 (2021) - 2020
- [j43]Ulrich Kohlenbach, Thomas Powell:
Rates of convergence for iterative solutions of equations involving set-valued accretive operators. Comput. Math. Appl. 80(3): 490-503 (2020) - 2019
- [j42]Ulrich Kohlenbach:
On the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness. Comput. 8(3-4): 377-387 (2019) - [j41]Ulrich Kohlenbach:
A Polynomial Rate of Asymptotic Regularity for Compositions of Projections in Hilbert Space. Found. Comput. Math. 19(1): 83-99 (2019) - 2018
- [j40]Makoto Fujiwara, Ulrich Kohlenbach:
Interrelation between Weak Fragments of double Negation Shift and Related Principles. J. Symb. Log. 83(3): 991-1012 (2018) - 2017
- [j39]Ulrich Kohlenbach:
Recent Progress in Proof Mining in Nonlinear Analysis. FLAP 4(10): 3357-3406 (2017) - [j38]Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz:
21st Workshop on Logic, Language, Information and Computation - WoLLIC 2014. Inf. Comput. 255: 193-194 (2017) - [j37]Leonid Libkin, Ulrich Kohlenbach, Ruy J. G. B. de Queiroz:
20th workshop on logic, language, information and computation - WoLLIC 2013. J. Comput. Syst. Sci. 88: 1-2 (2017) - [j36]Ulrich Kohlenbach, Adriana Nicolae:
A Proof-Theoretic Bound Extraction Theorem for CAT (κ) -Spaces. Stud Logica 105(3): 611-624 (2017) - 2015
- [j35]Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz:
21st Workshop on Logic, Language, Information and Computation (WoLLIC 2014). Log. J. IGPL 23(5): 848-859 (2015) - [j34]Makoto Fujiwara, Ulrich Kohlenbach:
Classical provability of uniform versions and intuitionistic provability. Math. Log. Q. 61(3): 132-150 (2015) - [j33]Ulrich Kohlenbach:
On the Disjunctive Markov Principle. Stud Logica 103(6): 1313-1317 (2015) - 2014
- [j32]Ulrich Kohlenbach, Pavol Safarik:
Fluctuations, effective learnability and metastability in analysis. Ann. Pure Appl. Log. 165(1): 266-304 (2014) - 2013
- [j31]Klaus Ambos-Spies, Joan Bagaria, Enrique Casanovas, Ulrich Kohlenbach:
Preface. Ann. Pure Appl. Log. 164(12): 1177 (2013) - 2012
- [j30]Ulrich Kohlenbach:
Gödel functional interpretation and weak compactness. Ann. Pure Appl. Log. 163(11): 1560-1579 (2012) - [j29]Ulrich Kohlenbach, Alexander Kreuzer:
Term extraction and Ramsey's theorem for pairs. J. Symb. Log. 77(3): 853-895 (2012) - 2011
- [j28]Ulrich Kohlenbach:
A note on the monotone functional interpretation. Math. Log. Q. 57(6): 611-614 (2011) - 2010
- [j27]Jaime Gaspar, Ulrich Kohlenbach:
On Tao's "finitary" infinite pigeonhole principle. J. Symb. Log. 75(1): 355-371 (2010) - [j26]Pavol Safarik, Ulrich Kohlenbach:
On the computational content of the Bolzano-Weierstraß Principle. Math. Log. Q. 56(5): 508-532 (2010) - 2009
- [j25]Yuri Leonidovich Ershov, Klaus Keimel, Ulrich Kohlenbach, Andrei S. Morozov:
Preface. Ann. Pure Appl. Log. 159(3): 249-250 (2009) - [j24]Ulrich Kohlenbach, Alexander Kreuzer:
Ramsey's Theorem for Pairs and Provably Recursive Functions. Notre Dame J. Formal Log. 50(4): 427-444 (2009) - 2007
- [j23]Ulrich Kohlenbach:
Proof Interpretations and the Computational Content of Proofs in Mathematics. Bull. EATCS 93: 143-175 (2007) - [j22]Thomas Streicher, Ulrich Kohlenbach:
Shoenfield is Gödel after Krivine. Math. Log. Q. 53(2): 176-179 (2007) - 2006
- [j21]Philipp Gerhardy, Ulrich Kohlenbach:
Strongly uniform bounds from semi-constructive proofs. Ann. Pure Appl. Log. 141(1-2): 89-107 (2006) - 2005
- [j20]Philipp Gerhardy, Ulrich Kohlenbach:
Extracting Herbrand disjunctions by functional interpretation. Arch. Math. Log. 44(5): 633-644 (2005) - [j19]Mircea-Dan Hernest, Ulrich Kohlenbach:
A complexity analysis of functional interpretations. Theor. Comput. Sci. 338(1-3): 200-246 (2005) - 2003
- [j18]Ulrich Kohlenbach, Paulo Oliva:
Proof mining in L1-approximation. Ann. Pure Appl. Log. 121(1): 1-38 (2003) - 2002
- [j17]Ulrich Kohlenbach:
On uniform weak König's lemma. Ann. Pure Appl. Log. 114(1-3): 103-116 (2002) - [j16]Ulrich Kohlenbach:
On Weak Markov's Principle. Math. Log. Q. 48(S1): 59-65 (2002) - 2001
- [j15]Ulrich Kohlenbach:
A note on Spector's quantifier-free rule of extensionality. Arch. Math. Log. 40(2): 89-92 (2001) - [j14]Ulrich Kohlenbach:
Intuitionistic Choice and Restricted Classical Logic. Math. Log. Q. 47(4): 455-460 (2001) - 2000
- [j13]Ulrich Kohlenbach:
Things That Can and Things That Cannot Be Done in PRA. Ann. Pure Appl. Log. 102(3): 223-245 (2000) - [j12]Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel:
Preface. Ann. Pure Appl. Log. 104(1-3): 1-2 (2000) - 1999
- [j11]Ulrich Kohlenbach:
On The No-Counterexample Interpretation. J. Symb. Log. 64(4): 1491-1511 (1999) - [j10]Ulrich Kohlenbach:
A Note on Goodman's Theorem. Stud Logica 63(1): 1-5 (1999) - 1998
- [j9]Ulrich Kohlenbach:
Elimination of Skolem functions for monotone formulas in analysis. Arch. Math. Log. 37(5-6): 363-390 (1998) - [j8]Ulrich Kohlenbach:
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness. Ann. Pure Appl. Log. 95(1-3): 257-285 (1998) - [j7]Ulrich Kohlenbach:
Relative Constructivity. J. Symb. Log. 63(4): 1218-1238 (1998) - 1996
- [j6]Ulrich Kohlenbach:
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. Arch. Math. Log. 36(1): 31-71 (1996) - 1995
- [j5]Ulrich Kohlenbach:
A note on theΠ20-induction rule. Arch. Math. Log. 34(4): 279-283 (1995) - 1993
- [j4]Ulrich Kohlenbach:
Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation. Ann. Pure Appl. Log. 64(1): 27-94 (1993) - 1992
- [j3]Ulrich Kohlenbach:
Pointwise hereditary majorization and some applications. Arch. Math. Log. 31(4): 227-241 (1992) - [j2]Ulrich Kohlenbach:
Remarks on Herbrand normal forms and Herbrand realizations. Arch. Math. Log. 31(5): 305-317 (1992) - [j1]Ulrich Kohlenbach:
Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization. J. Symb. Log. 57(4): 1239-1273 (1992)
Conference and Workshop Papers
- 2006
- [c5]Ulrich Kohlenbach:
A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces. WoLLIC 2006: 81-93 - 2005
- [c4]Ulrich Kohlenbach:
Proof Mining in Functional Analysis. CiE 2005: 233-234 - 2004
- [c3]Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach:
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. LICS 2004: 192-201 - 2000
- [c2]Ulrich Kohlenbach:
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. CCA 2000: 119-145 - 1997
- [c1]Ulrich Kohlenbach:
Proof theory and computational analysis. COMPROX 1997: 124-157
Editorship
- 2016
- [e3]Ulrich Kohlenbach, Steffen van Bakel, Stefano Berardi:
Proceedings Sixth International Workshop on Classical Logic and Computation, CL&C 2016, Porto, Portugal , 23th June 2016. EPTCS 213, 2016 [contents] - 2014
- [e2]Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 21st International Workshop, WoLLIC 2014, Valparaíso, Chile, September 1-4, 2014. Proceedings. Lecture Notes in Computer Science 8652, Springer 2014, ISBN 978-3-662-44144-2 [contents] - 2013
- [e1]Leonid Libkin, Ulrich Kohlenbach, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings. Lecture Notes in Computer Science 8071, Springer 2013, ISBN 978-3-642-39991-6 [contents]
Informal and Other Publications
- 2005
- [i2]Philipp Gerhardy, Ulrich Kohlenbach:
Generalized metatheorems on the extractability of uniform bounds in functional analysis. Mathematics, Algorithms, Proofs 2005 - [i1]Ulrich Kohlenbach, Laurentiu Leustean:
Approximate fixed points of nonexpansive functions in product spaces. Mathematics, Algorithms, Proofs 2005
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
