1 citations · 1 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
Intuitionism and computing with partial information
Hristo Ganchev, Paul Shafer, Theodore A. Slaman +2
There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For t…
Open Problems in Computability Theory and Descriptive Set Theory
George Barmpalias, Nikolay Bazhenov, Chi Tat Chong +11
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are…
Hausdorff dimension and countable Borel equivalence relations
Andrew Marks, Dino Rossegger, Theodore Slaman
We show that if is a countable Borel equivalence relation on , then there is a closed subset of Hausdorff dimension so that $E \restrictio…
Learning Equivalence Relations on Polish Spaces
Dino Rossegger, Theodore Slaman, Tomasz Steifer
We investigate natural variations of behaviourally correct learning and explanatory learning -- two learning paradigms studied in algorithmic learning theory -- that allow us to ``…