Skip to main content Accessibility help
×
×
Home

COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

  • MATTHEW HARRISON-TRAINOR (a1), ALEXANDER MELNIKOV (a2), RUSSELL MILLER (a3) and ANTONIO MONTALBÁN (a4)

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.

Copyright

References

Hide All
[1] Ash, Chris, Knight, Julia, Manasse, Mark, and Slaman, Theodore, Generic copies of countable structures . Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195205.
[2] Chisholm, John, Effective model theory vs. recursive model theory, this Journal, vol. 55 (1990), no. 3, pp. 11681191.
[3] Ershov, Yuri L., Definability and Computability. Siberian School of Algebra and Logic. Consultants Bureau, New York, 1996.
[4] Hirschfeldt, Denis R., Khoussainov, Bakhadyr, Shore, Richard A., and Slinko, Arkadii M., Degree spectra and computable dimensions in algebraic structures . Annals of Pure and Applied Logic, vol. 115 (2002), no. 1–3, pp. 71113.
[5] Hodges, Wilfrid, Model Theory, Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, Cambridge, 1993.
[6] Kalimullin, I. Sh., Relations between algebraic reducibilities of algebraic systems . Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, vol. 53 (2009), no. 6, pp. 7172.
[7] Marker, David, Model Theory, Graduate Texts in Mathematics, vol. 217, Springer-Verlag, New York, 2002.
[8] Melnikov, Alexander G., Computable ordered abelian groups and fields , In Programs, Proofs, Processes, Lecture Notes in Computer Science, vol. 6158, Springer, Berlin, 2010, pp. 321330.
[9] Melnikov, Alexander G., Effective properties of completely decomposable abelian groups . Ph.D. Thesis, Novosibirsk State University, 2012.
[10] Morozov, Andrei S. and Korovina, Margarita V., On Ʃ-definability without equality over the real numbers . Mathematical Logic Quarterly, vol. 54 (2008), no. 5, pp. 535544.
[11] Marker, David and Miller, Russell, Turing degree spectra of differentially closed fields, 2016, preprint.
[12] Montalbán, Antonio, Computability theoretic classifications for classes of structures , Proceedings of ICM 2014, vol. 2 (2014), pp. 79101.
[13] Montalbán, Antonio, Notes on the jump of a structure . In Mathematical Theory and Computational Practice, Lecture Notes in Computer Science, vol. 5635, Springer, Berlin, 2009, pp. 372378.
[14] Montalbán, Antonio, Rice sequences of relations . Philosophical Transactions of the Royal Society, A: Mathematical, Physical & Engineering Sciences, vol. 370 (2012), no. 1971, pp. 34643487.
[15] Montalbán, Antonio, A fixed point for the jump operator on structures, this Journal, vol. 78 (2013), no. 2, pp. 425438.
[16] Miller, R., Poonen, B., Schoutens, H., and Shlapentokh, A., A computable functor from graphs to fields, to appear.
[17] González, Victor Ocasio, Computability in the Class of Real Closed Fields , Ph.D. Thesis, Notre Dame University, 2014.
[18] Puzarenko, V. G., On a certain reducibility on admissible sets . Sibirskii Matematicheskii Zhurnal, vol. 50 (2009), no. 2, pp. 415429.
[19] Soskova, Alexandra A. and Soskov, Ivan N., A jump inversion theorem for the degree spectra . Journal of Logic and Computation, vol. 19 (2009), no. 1, pp. 199215.
[20] Stukachev, Alexey, Degrees of presentability of models. I . Algebra Logika, vol. 46 (2007), no. 6, pp. 763788, 793–794.
[21] Stukachev, Alexey, On degrees of presentability of models. II . Algebra Logika, vol. 47 (2008), no. 1, pp. 108126, 131.
[22] Stukachev, Alexey, Effective model theory: an approach via Ʃ-definability , Effective Mathematics of the Uncountable, Lecture Notes in Logic, vol. 41, pp. 164197, Association of Symbolic Logic, La Jolla, CA, 2013.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed