| Publication | Date of Publication | Type |
|---|
| Non-normal super-strict implications | 2025-01-09 | Paper |
Proof systems for super-strict implication
Studia Logica | 2024-04-10 | Paper |
Weihrauch Complexity in Computable Analysis
Theory and Applications of Computability | 2022-01-26 | Paper |
Super-strict implications
Bulletin of the Section of Logic | 2021-07-07 | Paper |
Weihrauch goes Brouwerian
Journal of Symbolic Logic | 2021-04-15 | Paper |
Completion of choice
Annals of Pure and Applied Logic | 2021-01-25 | Paper |
Interpolation in extensions of first-order logic
Studia Logica | 2020-06-09 | Paper |
Projection operators in the Weihrauch lattice
Computability | 2020-01-17 | Paper |
| The basis of Boole's logical calculus | 2017-10-04 | Paper |
Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma''
Annals of Pure and Applied Logic | 2017-05-18 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
| Las Vegas computability and algorithmic randomness | 2017-01-24 | Paper |
Probabilistic computability and choice
Information and Computation | 2015-06-01 | Paper |
How incomputable is the separable Hahn-Banach theorem?
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
| Weihrauch degrees, omniscience principles and weak computability | 2012-09-28 | Paper |
| Effective choice and boundedness principles in computable analysis | 2012-09-28 | Paper |
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Alan Turing and the foundations of computable analysis
The Bulletin of Symbolic Logic | 2011-10-11 | Paper |
Effective Choice and Boundedness Principles in Computable Analysis
The Bulletin of Symbolic Logic | 2011-03-21 | Paper |
Effective Choice and Boundedness Principles in Computable Analysis
The Bulletin of Symbolic Logic | 2011-03-21 | Paper |
Weihrauch degrees, omniscience principles and weak computability
Journal of Symbolic Logic | 2011-03-18 | Paper |
Weihrauch degrees, omniscience principles and weak computability
Journal of Symbolic Logic | 2011-03-18 | Paper |
How incomputable is the separable Hahn-Banach theorem?
Notre Dame Journal of Formal Logic | 2010-09-02 | Paper |
Computability and incomputability of differential equations
Deduction, Computation, Experiment | 2010-01-11 | Paper |
Borel Complexity of Topological Operations on Computable Metric Spaces
Journal Of Logic And Computation | 2009-03-02 | Paper |
Internal Computability
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Borel Complexity of Topological Operations on Computable Metric Spaces
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Effective Borel degrees of some topological functions
MLQ | 2007-02-02 | Paper |
