| Publication | Date of Publication | Type |
|---|
| Calculus of cost functions | 2024-09-06 | Paper |
Martin-Löf reducibility and cost functions
Israel Journal of Mathematics | 2024-06-25 | Paper |
Word automatic groups of nilpotency class 2
Information Processing Letters | 2023-10-12 | Paper |
MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
Journal of Symbolic Logic | 2023-09-11 | Paper |
| Logic Blog 2022 | 2023-02-23 | Paper |
| scientific article; zbMATH DE number 7650940 (Why is no real title available?) | 2023-02-07 | Paper |
Computable topological abelian groups
Journal of Algebra | 2022-11-23 | Paper |
The theory of the polynomial many-one degrees of recursive sets is undecidable
STACS 92 | 2022-08-18 | Paper |
Coarse groups, and the isomorphism problem for oligomorphic groups
Journal of Mathematical Logic | 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
Journal of Symbolic Logic | 2022-01-17 | Paper |
Randomness and initial segment complexity for measures
Theoretical Computer Science | 2021-12-22 | Paper |
Fraïssé limits for relational metric structures
Journal of Symbolic Logic | 2021-12-09 | Paper |
Highness properties close to PA completeness
Israel Journal of Mathematics | 2021-12-01 | Paper |
Muchnik degrees and cardinal characteristics
Journal of Symbolic Logic | 2021-10-27 | Paper |
Computable topological abelian groups
(available as arXiv preprint) | 2021-05-26 | Paper |
| Logic Blog 2020 | 2021-01-23 | Paper |
Closure of resource-bounded randomness notions under polynomial-time permutations
(available as arXiv preprint) | 2020-08-05 | Paper |
Computing from projections of random points
Journal of Mathematical Logic | 2020-06-26 | Paper |
Randomness notions and reverse mathematics
Journal of Symbolic Logic | 2020-04-17 | Paper |
Randomness notions and reverse mathematics
Journal of Symbolic Logic | 2020-04-17 | Paper |
| Logic Blog 2019 | 2020-02-28 | Paper |
From eventually different functions to pandemic numberings
(available as arXiv preprint) | 2020-02-03 | Paper |
Martin-Löf randomness implies multiple recurrence in effectively closed sets
Notre Dame Journal of Formal Logic | 2019-10-22 | Paper |
Martin-Löf random quantum states
Journal of Mathematical Physics | 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
(available as arXiv preprint) | 2019-02-21 | Paper |
Fra\"iss\'e Limits for Relational Metric Structures
(available as arXiv preprint) | 2019-01-07 | Paper |
The complexity of topological group isomorphism
Journal of Symbolic Logic | 2018-10-26 | Paper |
The complexity of topological group isomorphism
Journal of Symbolic Logic | 2018-10-26 | Paper |
Effectively closed subgroups of the infinite symmetric group
Proceedings of the American Mathematical Society | 2018-10-23 | Paper |
From eventually different functions to pandemic numberings
(available as arXiv preprint) | 2018-09-06 | Paper |
Randomness and Solovay degrees
Journal of Logic and Analysis | 2018-05-04 | Paper |
A unifying approach to the Gamma question
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Logic Blog 2017 | 2018-04-15 | Paper |
A universal separable diversity
Analysis and Geometry in Metric Spaces | 2018-04-06 | Paper |
Describing finite groups by short first-order sentences
Israel Journal of Mathematics | 2017-11-17 | Paper |
Metric Scott analysis
Advances in Mathematics | 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
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Calibrating the complexity of \(\Delta_2^0\) sets via their changes
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Using almost-everywhere theorems from analysis to study randomness
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
Lowness, Randomness, and Computable Analysis
Computability and Complexity | 2017-04-04 | Paper |
The reverse mathematics of theorems of Jordan and Lebesgue
(available as arXiv preprint) | 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 |
Lightface \(\varPi ^0_3\)-completeness of density sets under effective Wadge reducibility
Pursuit of the Universal | 2016-08-17 | Paper |
A computational approach to the Borwein-Ditor theorem
Pursuit of the Universal | 2016-08-17 | Paper |
Coherent randomness tests and computing the \(K\)-trivial sets
Journal of the European Mathematical Society (JEMS) | 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
The Bulletin of Symbolic Logic | 2016-03-21 | Paper |
| Logic Blog 2015f | 2016-02-14 | Paper |
Counting the changes of random \(\Delta_2^0\) sets
Journal Of Logic And Computation | 2016-01-28 | Paper |
| scientific article; zbMATH DE number 6536309 (Why is no real title available?) | 2016-01-27 | Paper |
Randomness and differentiability
Transactions of the American Mathematical Society | 2015-11-03 | Paper |
Local compactness for computable Polish metric spaces is \(\varPi ^1_1\)-complete
Evolving Computability | 2015-10-20 | Paper |
Solovay functions and their applications in algorithmic randomness
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Feasible analysis, randomness, and base invariance
Theory of Computing Systems | 2015-07-20 | Paper |
| Logic Blog 2014 | 2015-04-30 | Paper |
Universality for left-computably enumerable metric spaces
Lobachevskii Journal of Mathematics | 2015-03-17 | Paper |
Complexity of equivalence relations and preorders from computability theory
Journal of Symbolic Logic | 2014-12-05 | Paper |
Complexity of equivalence relations and preorders from computability theory
Journal of Symbolic Logic | 2014-12-05 | Paper |
Computuing \(K\)-trivial sets by incomplete random sets
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
Characterizing lowness for Demuth randomness
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Denjoy, Demuth and density
Journal of Mathematical Logic | 2014-09-05 | Paper |
Algorithmic aspects of Lipschitz functions
Computability | 2014-06-19 | Paper |
The complexity of recursive splittings of random sets
Computability | 2014-06-19 | Paper |
Joining non-low C.E. sets with diagonally non-computable functions
Journal Of Logic And Computation | 2014-04-01 | Paper |
| Logic Blog 2011 | 2014-03-23 | Paper |
| Logic Blog 2013 | 2014-03-22 | Paper |
Randomness notions and partial relativization
Israel Journal of Mathematics | 2013-11-01 | Paper |
| Coding Methods in Computability Theory and Complexity Theory | 2013-08-29 | Paper |
The classification problem for compact computable metric spaces
Lecture Notes in Computer Science | 2013-08-05 | Paper |
\(K\)-triviality in computable metric spaces
Proceedings of the American Mathematical Society | 2013-07-05 | Paper |
Lowness properties of reals and hyper-immunity
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
Trivial Reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
| Logic Blog 2012 | 2013-02-15 | Paper |
Characterizing the strongly jump-traceable sets via randomness
Advances in Mathematics | 2012-10-16 | Paper |
Computably enumerable sets below random sets
Annals of Pure and Applied Logic | 2012-09-26 | Paper |
Equivalence relations that are \(\Sigma^0_3\) complete for computable reducibility (extended abstract)
Logic, Language, Information and Computation | 2012-09-21 | Paper |
Low upper bounds in the Turing degrees revisited
Journal of Logic and Computation | 2012-09-05 | Paper |
| The Denjoy alternative for computable functions | 2012-08-23 | Paper |
Demuth's path to randomness
Computation, Physics and Beyond | 2012-06-15 | Paper |
| Computability and Randomness | 2012-04-25 | Paper |
| Studying randomness through computation | 2012-03-29 | Paper |
| Solovay functions and \(K\)-triviality | 2012-01-23 | Paper |
| Interactions of computability and randomness | 2011-11-11 | Paper |
Demuth randomness and computational complexity
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
Upper bounds on ideals in the computably enumerable Turing degrees
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
Finite automata presentable Abelian groups
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Higher Kurtz randomness
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Borel structures and Borel theories
Journal of Symbolic Logic | 2011-06-28 | Paper |
Universal recursively enumerable sets of strings
Theoretical Computer Science | 2011-05-10 | Paper |
Benign cost functions and lowness properties
Journal of Symbolic Logic | 2011-03-18 | Paper |
Superhighness
Notre Dame Journal of Formal Logic | 2010-09-02 | Paper |
Counting the changes of random \({\Delta}^0_2\) sets
Programs, Proofs, Processes | 2010-07-29 | Paper |
The First Order Theories of the Medvedev and Muchnik Lattices
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Superhighness and Strong Jump Traceability
Automata, Languages and Programming | 2009-07-14 | Paper |
Indifferent Sets
Journal Of Logic And Computation | 2009-04-16 | Paper |
| Computability and randomness | 2009-03-03 | Paper |
Universal Recursively Enumerable Sets of Strings
Developments in Language Theory | 2008-10-30 | Paper |
Describing Groups
The Bulletin of Symbolic Logic | 2008-10-23 | Paper |
| scientific article; zbMATH DE number 5354051 (Why is no real title available?) | 2008-10-20 | Paper |
| scientific article; zbMATH DE number 5354044 (Why is no real title available?) | 2008-10-20 | Paper |
| scientific article; zbMATH DE number 5354052 (Why is no real title available?) | 2008-10-20 | Paper |
Lowness of higher randomness notions
Israel Journal of Mathematics | 2008-10-16 | Paper |
FA-presentable groups and rings
Journal of Algebra | 2008-10-06 | Paper |
Lowness properties and approximations of the jump
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
Finite Automata Presentable Abelian Groups
Logical Foundations of Computer Science | 2008-01-04 | Paper |
A Weakly 2-Random Set That Is Not Generalized Low
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Automatic Structures: Richness and Limitations
Logical Methods in Computer Science | 2007-10-11 | Paper |
Using random sets as oracles
Journal of the London Mathematical Society | 2007-09-27 | Paper |
Randomness via effective descriptive set theory
Journal of the London Mathematical Society | 2007-07-23 | Paper |
Comparing quasi-finitely axiomatizable and prime groups
Journal of Group Theory | 2007-06-22 | Paper |
Non-cupping and randomness
Proceedings of the American Mathematical Society | 2007-02-01 | Paper |
Randomness and Computability: Open Questions
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Calibrating Randomness
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Lowness and nullsets
Journal of Symbolic Logic | 2006-11-29 | Paper |
| Reals which compute little | 2006-10-17 | Paper |
Lowness for the Class of Schnorr Random Reals
SIAM Journal on Computing | 2006-06-01 | Paper |
RELATIVIZING CHAITIN'S HALTING PROBABILITY
Journal of Mathematical Logic | 2006-04-06 | Paper |
Randomness, relativization and Turing degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
Kolmogorov-Loveland randomness and stochasticity
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Lowness properties and randomness
Advances in Mathematics | 2005-10-26 | Paper |
Program size complexity for possibly infinite computations
Notre Dame Journal of Formal Logic | 2005-07-06 | Paper |
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
Separating Classes of Groups by First-Order Sentences
International Journal of Algebra and Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2063218 (Why is no real title available?) | 2004-03-29 | Paper |
PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
Journal of Mathematical Logic | 2003-11-27 | Paper |
Global properties of the lattice of $\Pi ^0_1$ classes
Proceedings of the American Mathematical Society | 2003-09-28 | Paper |
| scientific article; zbMATH DE number 1984267 (Why is no real title available?) | 2003-09-22 | Paper |
Aspects of free groups.
Journal of Algebra | 2003-06-09 | Paper |
A new spectrum of recursive models
Notre Dame Journal of Formal Logic | 2003-03-27 | Paper |
Initial segments of the lattice of Π10 classes
Journal of Symbolic Logic | 2002-07-22 | Paper |
Randomness, computability, and density
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1688364 (Why is no real title available?) | 2002-01-09 | Paper |
On the filter of computably enumerable supersets of an r-maximal set
Archive for Mathematical Logic | 2001-12-13 | Paper |
Model theory of the computably enumerable many-one degrees
Logic Journal of the IGPL | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1543065 (Why is no real title available?) | 2001-02-26 | Paper |
Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
Annals of Pure and Applied Logic | 2001-02-11 | Paper |
| Differences of Computably Enumerable Sets | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1531930 (Why is no real title available?) | 2000-11-19 | Paper |
Structural properties and Σ20 enumeration degrees
Journal of Symbolic Logic | 2000-10-08 | Paper |
Effectively dense Boolean algebras and their applications
Transactions of the American Mathematical Society | 2000-10-03 | Paper |
Undecidability results for low complexity time classes
Journal of Computer and System Sciences | 2000-06-05 | Paper |
Atomless \(r\)-maximal sets
Israel Journal of Mathematics | 2000-02-14 | Paper |
Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
Israel Journal of Mathematics | 1999-09-15 | Paper |
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
Transactions of the American Mathematical Society | 1998-09-10 | Paper |
Interpretability and Definability in the Recursively Enumerable Degrees
Proceedings of the London Mathematical Society | 1998-08-11 | Paper |
| scientific article; zbMATH DE number 1136101 (Why is no real title available?) | 1998-05-06 | Paper |
Computable models of theories with few models
Notre Dame Journal of Formal Logic | 1998-05-04 | Paper |
Coding in the partial order of enumerable sets
Advances in Mathematics | 1998-03-31 | Paper |
| scientific article; zbMATH DE number 1048044 (Why is no real title available?) | 1998-03-23 | Paper |
Definability in the Recursively Enumerable Degrees
The Bulletin of Symbolic Logic | 1997-11-05 | Paper |
Definability in the Recursively Enumerable Degrees
The Bulletin of Symbolic Logic | 1997-11-05 | Paper |
Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
Bulletin of the London Mathematical Society | 1997-09-14 | Paper |
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
Journal of Symbolic Logic | 1996-06-13 | Paper |
Undecidable fragments of elementary theories
Algebra Universalis | 1996-06-06 | Paper |
Interpreting true arithmetic in the theory of the r.e. truth table degrees
Annals of Pure and Applied Logic | 1996-05-02 | Paper |
The last question on recursively enumerable \(m\)-degrees
Algebra and Logic | 1996-03-19 | Paper |
| scientific article; zbMATH DE number 841091 (Why is no real title available?) | 1996-02-26 | Paper |
Recursively Enumerable Equivalence Relations Modulo Finite Differences
Mathematical Logic Quarterly | 1994-12-08 | Paper |
| scientific article; zbMATH DE number 517082 (Why is no real title available?) | 1994-09-11 | Paper |
| scientific article; zbMATH DE number 535104 (Why is no real title available?) | 1994-03-21 | Paper |
Cappable recursively enumerable degrees and Post's program
Archive for Mathematical Logic | 1994-01-13 | Paper |
The theory of the recursively enumerable weak truth-table degrees is undecidable
Journal of Symbolic Logic | 1993-04-01 | Paper |
