2 citations · 7 across the 12 of their papers we have counts for
13 papers
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He +8
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Definability and Computation, June 22-26, 2026. The problems are organized into sect…
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
We show that there is a subset of the Euclidean plane, of Hausdorff dimension 1, such that for every line through the origin with hyperarithmetic direction, the…
Computing sets from all infinite subsets
Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey +1
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible se…
Computable classifications of continuous, transducer, and regular functions
Johanna N. Y. Franklin, Rupert Hölzl, Alexander Melnikov +2
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary…
Realizing Computably Enumerable Degrees in Separating Classes
Peter Cholak, Rod Downey, Noam Greenberg +1
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating class of c.e.\ degree. We show that for every c.e.\ de…
Coding in the automorphism group of a computably categorical structure
Dan Turetsky
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a que…