Computable functors and effective interpretability
Logic
2018-02-12 v1
Abstract
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.
Cite
@article{arxiv.1506.02737,
title = {Computable functors and effective interpretability},
author = {Matthew Harrison-Trainor and Alexander Melnikov and Russell Miller and Antonio Montalbán},
journal= {arXiv preprint arXiv:1506.02737},
year = {2018}
}
Comments
22 pages