Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-23T18:23:50.668Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphism relations on computable structures

Published online by Cambridge University Press:  12 March 2014

Ekaterina B. Fokina ,
Sy-David Friedman ,
Valentina Harizanov ,
Julia F. Knight ,
Charles Mccoy  and
Antonio Montalbán
Ekaterina B. Fokina
Affiliation:
Kurt Gödel Research Center, University of Vienna, Vienna, Austria E-mail: efokina@logic.univie.ac.at, E-mail: sdf@logic.univie.ac.at
Sy-David Friedman
Affiliation:
Kurt Gödel Research Center, University of Vienna, Vienna, Austria E-mail: efokina@logic.univie.ac.at, E-mail: sdf@logic.univie.ac.at
Valentina Harizanov
Affiliation:
Department of Mathematics, George Washington University, Washington, DC 20052, USA, E-mail: harizanv@gwu.edu
Julia F. Knight
Affiliation:
Department of Mathematics, University Of Notre Dame, Notre Dame, IN 46556, USA, E-mail: knight.1@nd.edu
Charles Mccoy
Affiliation:
Department of Mathematics, University of Portland, PortlandOR 97203, USA, E-mail: mccoy@up.edu
Antonio Montalbán
Affiliation:
Department of Mathematics, University of Chicago, Chicago, IL 60637, USA, E-mail: antonio@math.uchicago.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all equivalence relations on hyperarithmetical subsets of ω.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 77 , Issue 1 , March 2012 , pp. 122 - 132
Copyright
Copyright © Association for Symbolic Logic 2012

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.)

References

REFERENCES

[1] Ash, C. J. and Knight, J. F., Computable structures and the hyperarithmetical hierarchy, Elsevier, 2000.Google Scholar
[2] Calvert, W., Algebraic structure and computable structure, PhD Dissertation, University of Notre Dame, 2005.Google Scholar
[3] Calvert, W., Cenzer, D., Harizanov, V., and Morozov, A., Effective categoricity of equivalence structures, Annals of Pure and Applied Logic, vol. 141 (2006), pp. 61–78.CrossRefGoogle Scholar
[4] Calvert, W., Cummins, D., Knight, J. F., and Miller, S., Comparing classes of finite structures, Algebra and Logic, vol. 43 (2004), pp. 374–392.CrossRefGoogle Scholar
[5] Calvert, W., Knight, J., and Millar, J., Computable trees of Scott rank ωCK and computable approximations, this Journal, vol. 71 (2006), pp. 283–298.Google Scholar
[6] Carson, J., Fokina, E., Harizanov, V. S., Knight, J. F., Quinn, S., Safranski, C., and Wallbaum, J., Computable embedding problem, submitted.Google Scholar
[7] Cenzer, D., Harizanov, V., and Remmel, J., and equivalence structures, Computability in Europe, 2009, Lecture Notes in Computer Science, vol. 5635, 2009, pp. 99–108.Google Scholar
[8] Downey, R. and Montalban, A., The isomorphism problem for torsion-free Abelian groups is analytic complete, Journal of Algebra, vol. 320 (2008), pp. 2291–2300.CrossRefGoogle Scholar
[9] Fokina, E. and Friedman, S., Equivalence relations on classes of computable structures, Computability in Europe, 2009, Lecture Notes in Computer Science, vol. 5635, 2009, pp. 198–207.Google Scholar
[10] Fokina, E., equivalence relations on ω, submitted.Google Scholar
[11] Fokina, E., Friedman, S., and Törnquist, A., The effective theory of Borel equivalence relations, Annals of Pure and Applied Logic, vol. 161 (2010), pp. 837–850.CrossRefGoogle Scholar
[12] Fokina, E., Knight, J., Melnikov, A., Quinn, S., and Safranski, C., Ulm type, and coding rankhomogeneous trees in other structures, this Journal, vol. 76 (2011), pp. 846–869.Google Scholar
[13] Friedman, H. and Stanley, L., A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), pp. 894–914.Google Scholar
[14] Friedman, S. D. and Ros, L. Motto, Analytic equivalence relations and bi-embeddability, this Journal, vol. 76 (2011), pp. 243–266.Google Scholar
[15] Gao, S., Invariant descriptive set theory, Pure and Applied Mathematics, CRC Press/Chapman & Hall, 2009.Google Scholar
[16] Goncharov, S. S. and Knight, J. F., Computable structure and non-structure theorems, Algebra and Logic, vol. 41 (2002), pp. 351–373, English translation.CrossRefGoogle Scholar
[17] Harrison, J., Recursive pseudo well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526–543.CrossRefGoogle Scholar
[18] Hjorth, G., The isomorphism relation on countable torsion-free Abelian groups, Fundamenta Mathematica, vol. 175 (2002), pp. 241–257.CrossRefGoogle Scholar
[19] Kanovei, V., Borel equivalence relations. Structure and classification, University Lecture Series 44, American Mathematical Society, 2008.Google Scholar
[20] Kaplansky, I., Infinite Abelian groups, University of Michigan Press, Ann Arbor, 1954.Google Scholar
[21] Kechris, A., New directions in descriptive set theory, The Bulletin of Symbolic Logic, vol. 5 (1999), no. 2, pp. 161–174.CrossRefGoogle Scholar
[22] Kechris, A. and Louveau, A., The classification of hypersmooth Borel equivalence relations, Journal of the American Mathematical Society, vol. 10 (1997), no. 1, pp. 215–242.CrossRefGoogle Scholar
[23] Khoussainov, B., Stephan, F., and Yang, Y., Computable categoricity and the Ershov hierarchy, Annals of Pure and Applied Logic, vol. 156 (2008), pp. 86–95.CrossRefGoogle Scholar
[24] Knight, J. F., Quinn, S. Miller, and Boom, M. Vanden, Turing computable embeddings, this Journal, vol. 73 (2007), pp. 901–918.Google Scholar
[25] Louveau, A. and Rosendal, C., Complete analytic equivalence relations, Transactions of the American Mathematical Society, vol. 357 (2005), no. 12, pp. 4839–4866.CrossRefGoogle Scholar
[26] Montalbán, A., On the equimorphism types of linear orderings, The Bulletin of Symbolic Logic, vol. 13 (2007), pp. 71–99.CrossRefGoogle Scholar
[27] Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, 1967.Google Scholar
[28] Rogers, L., Ulm's theorem for partially ordered structures related to simply presented Abelian p-groups, Transactions of the American Mathematical Society, vol. 227 (1977), pp. 333–343.Google Scholar