Dan Turetsky
We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.
SJT reducibility between sets $A,B \subseteq \mathbb N$ is defined by $A \le_{SJT} B$ if for each computable function $h$ that is unbounded and nondecreasing, there is an $h$-bounded uniformly $B$-c.e.\ trace $(T_n)_{n \in \mathbb N} $ such…
In a previous paper, entitled "Structural Highness Notions," we defined several classes of degrees that are high in senses related to computable structure theory. Each class of degrees is characterized by a structural feature (e.g., an…
We present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff-Kuratowski and Wadge theorems on the structure of ${\mathbf \Delta}^0_\xi$, Louveau…
We give a new and effective classification of all Borel Wadge classes of subsets of Baire space. This relies on the true stage machinery originally developed by Montalb\'an. We use this machinery to give a new proof of Louveau and…
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…
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 sets and related notions. Our two main results are that the…
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 question of Bazhenov, Kalimulin and Yamaleev. Using the same…
We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $\Pi^0_1$ class with an $A$-computable element has a computable element. We prove that lowness for paths in Baire space and lowness for paths in Cantor space…
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…
We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.
We investigate effective properties of uncountable free abelian groups. We show that identifying free abelian groups and constructing bases for such groups is often computationally hard, depending on the cardinality. For example, we show,…
Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.