Abstract
It is well known that only a few structures can be described up to isomorphism by their elementary theories in the class of all models of fixed cardinality. Unfortunately, most of the natural and interesting structures fail to have this property.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Morozov, A.: On the theories of classes of recursive permutation groups. Siberian Advances in Mathematics 1(1), 138–153 (1991)
Nies, A.: Separating classes of groups by first–order sentences. Internat. J. Algebra Comput. 13, 287–302 (2003)
Morozov, A.S., Nies, A.: Finitely generated groups and first order logic. Journal of the London mathematical society (to appear)
Tennenbaum, S.: Non-archimedean models for arithmetic. Notices of the American Mathematical Society 6, 270 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morozov, A. (2005). Categoricity in Restricted Classes. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_43
Download citation
DOI: https://doi.org/10.1007/11494645_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)