Hostname: page-component-6bb9c88b65-vqtzn Total loading time: 0 Render date: 2025-07-26T14:29:18.614Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphism of Computable Structures and Vaught's Conjecture

Published online by Cambridge University Press:  12 March 2014

Howard Becker
Howard Becker*
Affiliation:
PMB 128, 4840 Forest Dr., Ste. 6–B, Columbia, SC 29206-4810, USA, E-mail: hsbecker@hotmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

The following question is open: Does there exist a hyperarithmetic class of computable structures with exactly one non-hyperarithmetic isomorphism-type? Given any oracle α ∈ 2ω, we can ask the same question relativized to α. A negative answer for every α implies Vaught's Conjecture for Lω1ω.

Keywords

Primary 03C5703D4503E15

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 78 , Issue 4 , December 2013 , pp. 1328 - 1344
Copyright
Copyright © Association for Symbolic Logic 2013

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

Article purchase

Temporarily unavailable

References

REFERENCES

[1] Ash, C. J. and Knight, J., Computable structures and the hyperarithmetical hierarchy, North-Holland, 2000.Google Scholar
[2] Barwise, J., Admissible sets and structures, Springer, 1975.Google Scholar
[3] Barwise, J. and Eklof, P., Infinitary properties of abelian torsion groups, Annals of Mathematical Logic, vol. 2 (1970/1971), pp. 25–68.Google Scholar
[4] Becker, H., The topological Vaught's conjecture and minimal counterexamples, this Journal, vol. 59 (1994), pp. 757–784.Google Scholar
[5] Becker, H., Polish group actions: dichotomies and generalized elementary embeddings, Journal of the American Mathematical Society, vol. 11 (1998), pp. 397–449.Google Scholar
[6] Becker, H., Polish group actions and generalized model theory, in preparation.Google Scholar
[7] Becker, H. and Kechris, A. S., The descriptive set theory of Polish group actions, Cambridge University Press, 1996.Google Scholar
[8] Fokina, E. and Friedman, S., Equivalence relations on classes of computable structures, Mathematical theory and computational practice (Ambos-Spies, Klaus et al., editors), Lecture Notes in Computer Science, vol. 5635, Springer, 2009, pp. 198–207.Google Scholar
[9] Fokina, E. B., Friedman, S. D., Harizanov, V., Knight, J. F., McCoy, C., and Montalban, A., Isomorphism relations on computable structures, this Journal, vol. 77 (2012), pp. 122–132.Google Scholar
[10] Friedman, H. and Stanley, L., A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), pp. 894–914.Google Scholar
[11] Gao, S., Invariant descriptive set theory, CRC Press / Chapman and Hall, 2009.Google Scholar
[12] Goncharov, S. S. and Knight, J. F., Computable structure and non-structure theorems, Algebra and Logic, vol. 41 (2002), pp. 351–373.Google Scholar
[13] Harnik, V. and Makkai, M., A tree argument in infinitary model theory, Proceedings of the American Mathematical Society, vol. 67 (1977), pp. 309–314.Google Scholar
[14] Harrington, L., Kechris, A. S., and Louveau, A., A Glimm-Effros dichotomyfor Borel equivalence relations, Journal of the American Mathematical Society, vol. 3 (1990), pp. 903–928.CrossRefGoogle Scholar
[15] Hjorth, G., Classification and orbit equivalence relations, American Mathematical Society, 2000.Google Scholar
[16] Moschovakis, Y. N., Descriptive set theory, North-Holland, 1980.Google Scholar
[17] Nadel, M., Scott sentences and admissible sets, Annals of Mathematical Logic, vol. 7 (1974), pp. 267–294.Google Scholar
[18] Sacks, G. E., Countable admissible ordinals and hyperdegrees, Advances in Mathematics, vol. 20 (1976), pp. 213–262.Google Scholar
[19] Sami, R. L., Polish group actions and the Vaught conjecture, Transactions of the American Mathematical Society, vol. 341 (1994), pp. 335–353.Google Scholar
[20] Steel, J. R., Forcing with tagged trees, Annals of Mathematical Logic, vol. 15 (1978), pp. 55–74.Google Scholar
[21] Vaught, R. L., Denumerable models of complete theories, Infinitistic Methods: Proceedings of the Symposium on Foundations ofMathematics, Pergamon Press, 1961, pp. 303–321.Google Scholar
[22] Vaught, R., Invariant sets in topology and logic, Fundamenta Mathematicae, vol. 82 (1974/1975), pp. 269–294.Google Scholar