Abstract
Computable structures of Scott rank \({\omega_1^{CK}}\) are an important boundary case for structural complexity. While every countable structure is determined, up to isomorphism, by a sentence of \({\mathcal{L}_{\omega_1 \omega}}\), this sentence may not be computable. We give examples, in several familiar classes of structures, of computable structures with Scott rank \({\omega_1^{CK}}\) whose computable infinitary theories are each \({\aleph_0}\)-categorical. General conditions are given, covering many known methods for constructing computable structures with Scott rank \({\omega_1^{CK}}\), which guarantee that the resulting structure is a model of an \({\aleph_0}\)-categorical computable infinitary theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Calvert, W., Goncharov, S.S., Knight, J.F.: Computable structures of Scott rank \({\omega_1^{CK}}\) in familiar classes. In: Gao, S., Jackson, S., Zhang, Y. (eds.) Advances in Logic. Con. Math., pp. 43–66 (2007)
Calvert W., Knight J.F., Millar J.: Trees of Scott rank \({\omega_1^{CK}}\), and computable approximability. J. Symb. Logic 71, 283–298 (2006)
Friedman H., Stanley L.: A Borel reducibility theory for classes of countable structures. J. Symb. Logic 54, 894–914 (1989)
Goncharov S.S., Harizanov V.S., Knight J.F., Shore R.: \({\Pi^1_1}\) relations and paths through \({\mathcal{O}}\). J. Symb. Logic 69, 585–611 (2004)
Harrison J.: Recursive pseudo well-orderings. Trans. Am. Math. Soc. 131, 526–543 (1968)
Hirschfeldt D., Khoussainov B., Shore R., Slinko A.: Degree spectra and computable dimension in algebraic structures. Ann. Pure Appl. Logic 115, 71–113 (2002)
Keisler, J.H.: Model Theory for Infinitary Logic. North-Holland, Amsterdam (1971)
Knight, J.F., Millar, J.: Computable structures of Scott rank \({\omega_1^{CK}}\). J. Math. Logic (submitted data)
Makkai M.: An example concerning Scott heights. J. Symb. Logic 46, 301–318 (1981)
Marker D.: Model Theory: An Introduction. Springer, Berlin (2002)
Millar, J., Sacks, G.: Atomic models higher up, pre-print
Nadel M.E.: Scott sentences for admissible sets. Ann. Math. Logic 7, 267–294 (1974)
Soskov I.N.: Intrinsically \({\Delta _{1}^{1}}\) relations. Math. Logic Q. 42, 469–480 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Work on this paper began at the Workshop on Model Theory and Computable Structure Theory at University of Florida Gainesville, in February, 2007. The authors are grateful to the organizers of this workshop. They are also grateful for financial support from National Science Foundation grants DMS DMS 05-32644, DMS 05-5484. The second author is also grateful for the support of grants RFBR 08-01-00336 and NSc-335.2008.1.
Rights and permissions
About this article
Cite this article
Calvert, W., Goncharov, S.S., Knight, J.F. et al. Categoricity of computable infinitary theories. Arch. Math. Logic 48, 25–38 (2009). https://doi.org/10.1007/s00153-008-0117-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-008-0117-z