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.

[1]  Alexandra A. Soskova.  A Jump Inversion Theorem for the Degree Spectra , 2007, CiE.

[2]  Antonio Montalbán,et al.  Notes on the Jump of a Structure , 2009, CiE.

[3]  Julia F. Knight,et al.  Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..

[4]  I︠U︡riĭ Leonidovich Ershov.  Definability and Computability , 1996 .

[5]  John Chisholm,et al.  Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.

[6]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

[7]  Antonio Montalbán.  A fixed point for the jump operator on structures , 2013, J. Symb. Log..

[8]  Joel David Hamkins,et al.  Effective model theory: approach via σ-definability , 2013 .

[9]  Victor A. Ocasio.  Computability in the class of Real Closed Fields , 2014 .

[10]  Antonio Montalbán,et al.  Rice sequences of relations , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[11]  Andrei S. Morozov,et al.  On Σ‐definability without equality over the real numbers , 2008, Math. Log. Q..

[12]  Russell G. Miller,et al.  Turing degree spectra of differentially Closed Fields , 2017, J. Symb. Log..

[13]  V. Puzarenko.  A certain reducibility on admissible sets , 2009 .

[14]  A. Stukachev,et al.  Degrees of presentability of structures. I , 2007 .

[15]  Arkadii M. Slinko,et al.  Degree spectra and computable dimensions in algebraic structures , 2002, Ann. Pure Appl. Log..

[16]  Antonio Montalbán,et al.  Computability theoretic classifications for classes of structures , 2014 .

[17]  Alexander G. Melnikov,et al.  Computable Ordered Abelian Groups and Fields , 2010, CiE.

[18]  Alexandra Shlapentokh,et al.  A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS , 2015, The Journal of Symbolic Logic.