Michael Deveau, Department of Pure Mathematics, University of Waterloo
“Computable Functors and Effective Interpretability”
We introduce the notion of a computable functor and the definition of effective inter- pretability. The former is a computable analogue of a category-theoretic functor between ω-presentations of structures, and the latter is an effective version of model-theoretic inter- pretability. We show that effective interpretations induce computable functors, and briefly mention the converse.
MC 5403