Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-30T19:45:50.307Z Has data issue: false hasContentIssue false

BOREL FUNCTORS AND INFINITARY INTERPRETATIONS

Published online by Cambridge University Press:  05 October 2018

MATTHEW HARRISON-TRAINOR
Affiliation:
GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE UNIVERSITY OF CALIFORNIA BERKELEY, CA, USA
RUSSELL MILLER
Affiliation:
MATHEMATICS DEPT., QUEENS COLLEGE PH.D. PROGRAMS IN MATHEMATICS & COMPUTER SCIENCE GRADUATE CENTER, CITY UNIVERSITY OF NEW YORK NEW YORK, NY, USAE-mail:[email protected]: http://qcpages.qc.cuny.edu/∼rmiller
ANTONIO MONTALBÁN
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA BERKELEY, CA, USAE-mail:[email protected]: www.math.berkeley.edu/∼antonio

Abstract

We introduce the notion of infinitary interpretation of structures. In general, an interpretation between structures induces a continuous homomorphism between their automorphism groups, and furthermore, it induces a functor between the categories of copies of each structure. We show that for the case of infinitary interpretation the reversals are also true: every Baire-measurable homomorphism between the automorphism groups of two countable structures is induced by an infinitary interpretation, and every Baire-measurable functor between the set of copies of two countable structures is induced by an infinitary interpretation. Furthermore, we show that the complexities are maintained in the sense that if the functor is ${\bf{\Delta }}_\alpha ^0$, then the interpretation that induces it is ${\rm{\Delta }}_\alpha ^{in}$ up to ${\bf{\Delta }}_\alpha ^0$ equivalence.

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

Current address: DEPARTMENT OF PURE MATHEMATICS UNIVERSITY OF WATERLOO CANADA E-mail: [email protected]URL: http://www.math.uwaterloo.ca/∼maharris/

References

REFERENCES

Ash, C. J. and Knight, J., Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, North-Holland, Amsterdam, 2000.Google Scholar
Ahlbrandt, G. and Ziegler, M., Quasi-finitely axiomatizable totally categorical theories. Annals of Pure and Applied Logic, vol. 30 (1986), no. 1, pp. 6382. Stability in model theory (Trento, 1984).CrossRefGoogle Scholar
Baldwin, J. T., Friedman, S. D., Koerwien, M., and Laskowski, M. C., Three red herrings around Vaught’s conjecture. Transactions of the American Mathematical Society, vol. 368 (2016), no. 5, pp. 36733694.CrossRefGoogle Scholar
Evans, D. M. and Hewitt, P. R., Counterexamples to a conjecture on relative categoricity. Annals of Pure and Applied Logic, vol. 46 (1990), no. 2, pp. 201209.CrossRefGoogle Scholar
Gao, S., Invariant Descriptive Set Theory, Pure and Applied Mathematics, vol. 293, CRC Press, Boca Raton, FL, 2009.Google Scholar
Hjorth, G., A note on counterexamples to the Vaught conjecture. Notre Dame Journal of Formal Logic, vol. 48 (2007), no. 1, pp. 4951.CrossRefGoogle Scholar
Hirschfeldt, D. R., Khoussainov, B., Shore, R. A., and Slinko, A. M., Degree spectra and computable dimensions in algebraic structures. Annals of Pure and Applied Logic, vol. 115 (2002), no. 1–3, pp. 71113.CrossRefGoogle Scholar
Hodges, W., Model Theory, Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, Cambridge, 1993.CrossRefGoogle Scholar
Harrison-Trainor, M., Igusa, G., and Knight, J. F., Some new computable structures of high rank. Preprint, 2016. Available at https://math.berkeley.edu/∼mattht/papers/high-scott-rank.pdf.Google Scholar
Harrison-Trainor, M., Melnikov, A., Miller, R., and Montalbán, A., Computable functors and effective interpretability, this Journal, vol. 82 (2017), no. 1, pp. 7797.Google Scholar
Kueker, D. W., Definability, automorphisms, and infinitary languages, The Syntax and Semantics of Infinitary Languages (Barwise, J., editor), Springer, Berlin, Heidelberg, 1968, pp. 152165.CrossRefGoogle Scholar
Makkai, M., An application of a method of Smullyan to logics on admissible sets. Bulletin de l’Académie polonaise des sciences. Série des sciences mathématiques, astronomiques, et physiques, vol. 17 (1969), pp. 341346.Google Scholar
Montalbán, A., Computability theoretic classifications for classes of structures. Proceedings of ICM 2014, vol. 2 (2014), pp. 79-101.Google Scholar
Montalbán, A., A fixed point for the jump operator on structures, this Journal, vol. 78 (2013), no. 2, pp. 425438.Google Scholar
Montalbán, A., A robuster Scott rank. Proceedings of the American Mathematical Society, vol. 143 (2015), no. 12, pp. 54275436.CrossRefGoogle Scholar
Miller, R., Poonen, B., Schoutens, H., and Shlapentokh, A., A computable functor from graphs to fields. Preprint, 2015. Available at https://arxiv.org/pdf/1510.07322.pdf.Google Scholar
Shelah, S., Can you take Solovay’s inaccessible away? Israel Journal of Mathematics, vol. 48 (1984), no. 1, pp. 147.CrossRefGoogle Scholar
Solovay, R. M., A model of set-theory in which every set of reals is Lebesgue measurable. Annals of Mathematics (2), vol. 92 (1970), pp. 156.CrossRefGoogle Scholar