Ulrich Kohlenbach

According to our database, Ulrich Kohlenbach authored at least 56 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On Modified Halpern and Tikhonov-Mann Iterations.

Horatiu Cheval, Ulrich Kohlenbach, Laurentiu Leustean

J. Optim. Theory Appl., April, 2023

2022

On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space.

Ulrich Kohlenbach

Optim. Lett., 2022

Correction to: Quantitative analysis of a subgradient-type method for equilibrium problems.

Nicholas Pischke, Ulrich Kohlenbach

Numer. Algorithms, 2022

Quantitative analysis of a subgradient-type method for equilibrium problems.

Nicholas Pischke, Ulrich Kohlenbach

Numer. Algorithms, 2022

2021

Proof-theoretic uniform boundedness and bounded collection principles and countable Heine-Borel compactness.

Ulrich Kohlenbach

Arch. Math. Log., 2021

2020

Rates of convergence for iterative solutions of equations involving set-valued accretive operators.

Ulrich Kohlenbach, Thomas Powell

Comput. Math. Appl., 2020

2019

A Polynomial Rate of Asymptotic Regularity for Compositions of Projections in Hilbert Space.

Ulrich Kohlenbach

Found. Comput. Math., 2019

On the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness.

Ulrich Kohlenbach

Comput., 2019

2018

Interrelation between Weak Fragments of double Negation Shift and Related Principles.

Makoto Fujiwara, Ulrich Kohlenbach

J. Symb. Log., 2018

2017

A Proof-Theoretic Bound Extraction Theorem for CAT (κ) -Spaces.

Ulrich Kohlenbach, Adriana Nicolae

Stud Logica, 2017

20th workshop on logic, language, information and computation - WoLLIC 2013.

Leonid Libkin, Ulrich Kohlenbach, Ruy J. G. B. de Queiroz

J. Comput. Syst. Sci., 2017

21st Workshop on Logic, Language, Information and Computation - WoLLIC 2014.

Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz

Inf. Comput., 2017

Recent Progress in Proof Mining in Nonlinear Analysis.

Ulrich Kohlenbach

FLAP, 2017

2015

On the Disjunctive Markov Principle.

Ulrich Kohlenbach

Stud Logica, 2015

Classical provability of uniform versions and intuitionistic provability.

Makoto Fujiwara, Ulrich Kohlenbach

Math. Log. Q., 2015

21st Workshop on Logic, Language, Information and Computation (<i>WoLLIC 2014</i>).

Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz

Log. J. IGPL, 2015

2014

Fluctuations, effective learnability and metastability in analysis.

Ulrich Kohlenbach, Pavol Safarik

Ann. Pure Appl. Log., 2014

2013

Preface.

Klaus Ambos-Spies, Joan Bagaria, Enrique Casanovas, Ulrich Kohlenbach

Ann. Pure Appl. Log., 2013

2012

Term extraction and Ramsey's theorem for pairs.

Ulrich Kohlenbach, Alexander Kreuzer

J. Symb. Log., 2012

Gödel functional interpretation and weak compactness.

Ulrich Kohlenbach

Ann. Pure Appl. Log., 2012

2011

A note on the monotone functional interpretation.

Ulrich Kohlenbach

Math. Log. Q., 2011

2010

On the computational content of the Bolzano-Weierstraß Principle.

Pavol Safarik, Ulrich Kohlenbach

Math. Log. Q., 2010

On Tao's "finitary" infinite pigeonhole principle.

Jaime Gaspar, Ulrich Kohlenbach

J. Symb. Log., 2010

2009

Ramsey's Theorem for Pairs and Provably Recursive Functions.

Ulrich Kohlenbach, Alexander Kreuzer

Notre Dame J. Formal Log., 2009

Preface.

Yuri Leonidovich Ershov, Klaus Keimel, Ulrich Kohlenbach, Andrei S. Morozov

Ann. Pure Appl. Log., 2009

2008

Applied Proof Theory - Proof Interpretations and their Use in Mathematics.

Ulrich Kohlenbach

Springer Monographs in Mathematics, Springer, ISBN: 978-3-540-77532-4, 2008

2007

Shoenfield is Gödel after Krivine.

Thomas Streicher, Ulrich Kohlenbach

Math. Log. Q., 2007

Proof Interpretations and the Computational Content of Proofs in Mathematics.

Ulrich Kohlenbach

Bull. EATCS, 2007

2006

A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces.

Ulrich Kohlenbach

Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

Strongly uniform bounds from semi-constructive proofs.

Philipp Gerhardy, Ulrich Kohlenbach

Ann. Pure Appl. Log., 2006

2005

A complexity analysis of functional interpretations.

Mircea-Dan Hernest, Ulrich Kohlenbach

Theor. Comput. Sci., 2005

Extracting Herbrand disjunctions by functional interpretation.

Philipp Gerhardy, Ulrich Kohlenbach

Arch. Math. Log., 2005

Approximate fixed points of nonexpansive functions in product spaces.

Ulrich Kohlenbach, Laurentiu Leustean

Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

Generalized metatheorems on the extractability of uniform bounds in functional analysis.

Philipp Gerhardy, Ulrich Kohlenbach

Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

Proof Mining in Functional Analysis.

Ulrich Kohlenbach

Proceedings of the New Computational Paradigms, 2005

2004

An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles.

Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

Proof mining in <i>L</i>₁-approximation.

Ulrich Kohlenbach, Paulo Oliva

Ann. Pure Appl. Log., 2003

2002

On Weak Markov's Principle.

Ulrich Kohlenbach

Math. Log. Q., 2002

On uniform weak König's lemma.

Ulrich Kohlenbach

Ann. Pure Appl. Log., 2002

2001

Intuitionistic Choice and Restricted Classical Logic.

Ulrich Kohlenbach

Math. Log. Q., 2001

A note on Spector's quantifier-free rule of extensionality.

Ulrich Kohlenbach

Arch. Math. Log., 2001

2000

Things That Can and Things That Cannot Be Done in PRA.

Ulrich Kohlenbach

Ann. Pure Appl. Log., 2000

Preface.

Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel

Ann. Pure Appl. Log., 2000

On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.

Ulrich Kohlenbach

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

A Note on Goodman's Theorem.

Ulrich Kohlenbach

Stud Logica, 1999

On The No-Counterexample Interpretation.

Ulrich Kohlenbach

J. Symb. Log., 1999

1998

Relative Constructivity.

Ulrich Kohlenbach

J. Symb. Log., 1998

On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness.

Ulrich Kohlenbach

Ann. Pure Appl. Log., 1998

Elimination of Skolem functions for monotone formulas in analysis.

Ulrich Kohlenbach

Arch. Math. Log., 1998

1997

Proof theory and computational analysis.

Ulrich Kohlenbach

Proceedings of the Third Workshop on Computation and Approximation, 1997

1996

Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.

Ulrich Kohlenbach

Arch. Math. Log., 1996

1995

A note on the<i>Π</i>₂⁰-induction rule.

Ulrich Kohlenbach

Arch. Math. Log., 1995

1993

Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation.

Ulrich Kohlenbach

Ann. Pure Appl. Log., 1993

1992

Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization.

Ulrich Kohlenbach

J. Symb. Log., 1992

Remarks on Herbrand normal forms and Herbrand realizations.

Ulrich Kohlenbach

Arch. Math. Log., 1992

Pointwise hereditary majorization and some applications.

Ulrich Kohlenbach

Arch. Math. Log., 1992