Matthew Harrison-Trainor

Computable functors and effective interpretability

Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a strengthening of the well-known Medvedev reducibility. We extend our result to effective bi-interpretability and also to effective reductions between classes of structures.

The Gamma question for many-one degrees

A set

Inferring Probability Comparisons

A

Degrees of categoricity on a Cone via η-systems

is coarsely computable with density

On Computable Field Embeddings and Difference Closed Fields

r \in [0,1]

BOREL FUNCTORS AND INFINITARY INTERPRETATIONS

if there is an algorithm for deciding membership in

LEFT-ORDERABLE COMPUTABLE GROUPS

A

Computable valued fields

which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least

Independence in computable algebra

r

Nonstandard methods for bounds in differential polynomial rings

. To any Turing degree