| Publication | Date of Publication | Type |
|---|
| Calculus of cost functions | 2024-09-06 | Paper |
| Martin-Löf reducibility and cost functions | 2024-06-25 | Paper |
| Word automatic groups of nilpotency class 2 | 2023-10-12 | Paper |
| MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY | 2023-09-11 | Paper |
| Logic Blog 2022 | 2023-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874332 | 2023-02-07 | Paper |
| Computable topological abelian groups | 2022-11-23 | Paper |
| The theory of the polynomial many-one degrees of recursive sets is undecidable | 2022-08-18 | Paper |
| Coarse groups, and the isomorphism problem for oligomorphic groups | 2022-06-17 | Paper |
| Computably totally disconnected locally compact groups | 2022-04-21 | Paper |
| Logic Blog 2021 | 2022-02-28 | Paper |
| THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE | 2022-01-17 | Paper |
| Randomness and initial segment complexity for measures | 2021-12-22 | Paper |
| FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES | 2021-12-09 | Paper |
| Highness properties close to PA completeness | 2021-12-01 | Paper |
| MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS | 2021-10-27 | Paper |
| Computable topological abelian groups | 2021-05-26 | Paper |
| Logic Blog 2020 | 2021-01-23 | Paper |
| Closure of resource-bounded randomness notions under polynomial time permutations | 2020-08-05 | Paper |
| Computing from projections of random points | 2020-06-26 | Paper |
| RANDOMNESS NOTIONS AND REVERSE MATHEMATICS | 2020-04-17 | Paper |
| Logic Blog 2019 | 2020-02-28 | Paper |
| From eventually different functions to pandemic numberings | 2020-02-03 | Paper |
| Martin-Löf randomness implies multiple recurrence in effectively closed sets | 2019-10-22 | Paper |
| Martin-Löf random quantum states | 2019-10-11 | Paper |
| The Scott rank of Polish metric spaces | 2019-06-02 | Paper |
| Logic Blog 2018 | 2019-02-22 | Paper |
| Randomness and initial segment complexity for probability measures | 2019-02-21 | Paper |
| Fra\"iss\'e Limits for Relational Metric Structures | 2019-01-07 | Paper |
| THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM | 2018-10-26 | Paper |
| Effectively closed subgroups of the infinite symmetric group | 2018-10-23 | Paper |
| From eventually different functions to pandemic numberings | 2018-09-06 | Paper |
| Randomness and Solovay degrees | 2018-05-04 | Paper |
| A Unifying Approach to the Gamma Question | 2018-04-23 | Paper |
| Logic Blog 2017 | 2018-04-15 | Paper |
| A universal separable diversity | 2018-04-06 | Paper |
| Describing finite groups by short first-order sentences | 2017-11-17 | Paper |
| Metric Scott analysis | 2017-09-04 | Paper |
| Martin-L\"of reducibility and cost functions | 2017-07-02 | Paper |
| An Analogy between Cardinal Characteristics and Highness Properties of Oracles | 2017-06-09 | Paper |
| Calibrating the complexity of $\Delta^{0}_{2}$ sets via their changes | 2017-05-31 | Paper |
| USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS | 2017-05-26 | Paper |
| The reverse mathematics of theorems of Jordan and Lebesgue | 2017-04-04 | Paper |
| Lowness, Randomness, and Computable Analysis | 2017-04-04 | Paper |
| Logic Blog 2016 | 2017-03-05 | Paper |
| Calculus of Cost Functions | 2017-03-05 | Paper |
| Differentiability of polynomial time computable functions | 2017-03-03 | Paper |
| Calibrating word problems of groups via the complexity of equivalence relations | 2016-09-12 | Paper |
| A Computational Approach to the Borwein-Ditor Theorem | 2016-08-17 | Paper |
| Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility | 2016-08-17 | Paper |
| Coherent randomness tests and computing the \(K\)-trivial sets | 2016-05-02 | Paper |
| Multiple Recurrence and Algorithmic Randomness | 2016-04-14 | Paper |
| The complexity of isomorphism between countably based profinite groups | 2016-04-03 | Paper |
| DEMUTH’S PATH TO RANDOMNESS | 2016-03-21 | Paper |
| Logic Blog 2015f | 2016-02-14 | Paper |
| Counting the changes of random Δ20 sets | 2016-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464659 | 2016-01-27 | Paper |
| Randomness and differentiability | 2015-11-03 | Paper |
| Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete | 2015-10-20 | Paper |
| Solovay functions and their applications in algorithmic randomness | 2015-08-31 | Paper |
| Feasible analysis, randomness, and base invariance | 2015-07-20 | Paper |
| Logic Blog 2014 | 2015-04-30 | Paper |
| Universality for left-computably enumerable metric spaces | 2015-03-17 | Paper |
| COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | 2014-12-05 | Paper |
| COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS | 2014-10-21 | Paper |
| CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS | 2014-09-30 | Paper |
| Denjoy, Demuth and density | 2014-09-05 | Paper |
| The Complexity of Recursive Splittings of Random Sets | 2014-06-19 | Paper |
| Algorithmic Aspects of Lipschitz Functions | 2014-06-19 | Paper |
| Joining non-low C.E. sets with diagonally non-computable functions | 2014-04-01 | Paper |
| Logic Blog 2011 | 2014-03-23 | Paper |
| Logic Blog 2013 | 2014-03-22 | Paper |
| Randomness notions and partial relativization | 2013-11-01 | Paper |
| Coding Methods in Computability Theory and Complexity Theory | 2013-08-29 | Paper |
| The Classification Problem for Compact Computable Metric Spaces | 2013-08-05 | Paper |
| $K$-triviality in computable metric spaces | 2013-07-05 | Paper |
| Lowness Properties of Reals and Hyper-Immunity | 2013-06-06 | Paper |
| Trivial Reals | 2013-04-19 | Paper |
| Logic Blog 2012 | 2013-02-15 | Paper |
| Characterizing the strongly jump-traceable sets via randomness | 2012-10-16 | Paper |
| Computably enumerable sets below random sets | 2012-09-26 | Paper |
| Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility | 2012-09-21 | Paper |
| Low upper bounds in the Turing degrees revisited | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904792 | 2012-08-23 | Paper |
| Demuth’s Path to Randomness | 2012-06-15 | Paper |
| Computability and Randomness | 2012-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224092 | 2012-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113710 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096589 | 2011-11-11 | Paper |
| Upper bounds on ideals in the computably enumerable Turing degrees | 2011-09-22 | Paper |
| Demuth randomness and computational complexity | 2011-09-22 | Paper |
| Finite automata presentable Abelian groups | 2011-08-26 | Paper |
| Higher Kurtz randomness | 2011-08-26 | Paper |
| Borel structures and Borel theories | 2011-06-28 | Paper |
| Universal recursively enumerable sets of strings | 2011-05-10 | Paper |
| Benign cost functions and lowness properties | 2011-03-18 | Paper |
| Superhighness | 2010-09-02 | Paper |
| Counting the Changes of Random ${\Delta^0_2}$ Sets | 2010-07-29 | Paper |
| The First Order Theories of the Medvedev and Muchnik Lattices | 2010-07-28 | Paper |
| Superhighness and Strong Jump Traceability | 2009-07-14 | Paper |
| Indifferent Sets | 2009-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3611832 | 2009-03-03 | Paper |
| Universal Recursively Enumerable Sets of Strings | 2008-10-30 | Paper |
| Describing Groups | 2008-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530393 | 2008-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530400 | 2008-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530401 | 2008-10-20 | Paper |
| Lowness of higher randomness notions | 2008-10-16 | Paper |
| FA-presentable groups and rings | 2008-10-06 | Paper |
| Lowness properties and approximations of the jump | 2008-03-28 | Paper |
| Finite Automata Presentable Abelian Groups | 2008-01-04 | Paper |
| A Weakly 2-Random Set That Is Not Generalized Low | 2007-11-13 | Paper |
| Automatic Structures: Richness and Limitations | 2007-10-11 | Paper |
| Using random sets as oracles | 2007-09-27 | Paper |
| Randomness via effective descriptive set theory | 2007-07-23 | Paper |
| Comparing quasi-finitely axiomatizable and prime groups | 2007-06-22 | Paper |
| Non-cupping and randomness | 2007-02-01 | Paper |
| Randomness and Computability: Open Questions | 2006-12-06 | Paper |
| Calibrating Randomness | 2006-12-06 | Paper |
| Lowness and nullsets | 2006-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494235 | 2006-10-17 | Paper |
| Lowness for the Class of Schnorr Random Reals | 2006-06-01 | Paper |
| RELATIVIZING CHAITIN'S HALTING PROBABILITY | 2006-04-06 | Paper |
| Randomness, relativization and Turing degrees | 2006-01-16 | Paper |
| Kolmogorov-Loveland randomness and stochasticity | 2005-12-29 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Lowness properties and randomness | 2005-10-26 | Paper |
| Program size complexity for possibly infinite computations | 2005-07-06 | Paper |
| The ∀∃-theory of ℛ(≤,∨,∧) is undecidable | 2004-08-13 | Paper |
| Separating Classes of Groups by First-Order Sentences | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460833 | 2004-03-29 | Paper |
| PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES | 2003-11-27 | Paper |
| Global properties of the lattice of $\Pi ^0_1$ classes | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428701 | 2003-09-22 | Paper |
| Aspects of free groups. | 2003-06-09 | Paper |
| A new spectrum of recursive models | 2003-03-27 | Paper |
| Initial segments of the lattice of Π10 classes | 2002-07-22 | Paper |
| Randomness, Computability, and Density | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762505 | 2002-01-09 | Paper |
| On the filter of computably enumerable supersets of an r-maximal set | 2001-12-13 | Paper |
| Model theory of the computably enumerable many-one degrees | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520520 | 2001-02-26 | Paper |
| Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees | 2001-02-11 | Paper |
| Differences of Computably Enumerable Sets | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513973 | 2000-11-19 | Paper |
| Structural properties and Σ20 enumeration degrees | 2000-10-08 | Paper |
| Effectively dense Boolean algebras and their applications | 2000-10-03 | Paper |
| Undecidability results for low complexity time classes | 2000-06-05 | Paper |
| Atomless \(r\)-maximal sets | 2000-02-14 | Paper |
| Branching in the enumeration degrees of the \(\Sigma_2^0\) sets | 1999-09-15 | Paper |
| The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable | 1998-09-10 | Paper |
| Interpretability and Definability in the Recursively Enumerable Degrees | 1998-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381411 | 1998-05-06 | Paper |
| Computable models of theories with few models | 1998-05-04 | Paper |
| Coding in the partial order of enumerable sets | 1998-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348130 | 1998-03-23 | Paper |
| Definability in the Recursively Enumerable Degrees | 1997-11-05 | Paper |
| Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras | 1997-09-14 | Paper |
| The undecidability of the Π4-theory for the r.e. wtt and Turing degrees | 1996-06-13 | Paper |
| Undecidable fragments of elementary theories | 1996-06-06 | Paper |
| Interpreting true arithmetic in the theory of the r.e. truth table degrees | 1996-05-02 | Paper |
| The last question on recursively enumerable \(m\)-degrees | 1996-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863247 | 1996-02-26 | Paper |
| Recursively Enumerable Equivalence Relations Modulo Finite Differences | 1994-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4282612 | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4285797 | 1994-03-21 | Paper |
| Cappable recursively enumerable degrees and Post's program | 1994-01-13 | Paper |
| The theory of the recursively enumerable weak truth-table degrees is undecidable | 1993-04-01 | Paper |
