Abstract
The index set of computable structures with decidable theory for some fixed infinite language σ * is m–complete \(\Sigma^{0,\emptyset^{(\omega)}}_2\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Calvert, W.: The isomorphism problem for classes of computable fields. Archive for Mathematical Logic 75, 327–336 (2004)
Calvert, W.: The isomorphism problem for computable Abelian p-groups of bounded length. Journal of Symbolic Logic 70, 331–345 (2005)
Calvert, W., Cummins, D., Knight, J.F., Miller, S.: Comparing classes of finite structures. Algebra and Logic 43, 374–392 (2004)
Calvert, W., Harizanov, V., Knight, J.F., Miller, S.: Index sets of computable structures. Algebra and Logic 45, 306–325 (2006)
Csima, B.F., Montalbán, A., Shore, R.A.: Boolean algebras, Tarski invariants, and index sets. In the Notre Dame Journal of Formal Logic (to appear)
Dobritsa, V.P.: Complexity of the index set of a constructive model. Algebra and Logic 22, 269–276 (1983)
Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra and Logic (English translation) 41, 351–373 (2002)
Lempp, S., Slaman, T.: The complexity of the index sets of \(\aleph_{0}\)-categorical theories and of Ehrenfeucht theories, to appear in the Advances in Logic In: Proceedings of the North Texas Logic Conference, Contemporary Mathematics, American Mathematical Society. October 8–10, (2004)
White, W.: On the complexity of categoricity in computable structures. Mathematical Logic Quarterly 49, 603–614 (2003)
White, W.: Characterizations for Computable Structures, PhD dissertation, Cornell University (2000)
Fokina, E.: Index sets of decidable models, Sibirsk. Mat. Zh (To appear)
Goncharov, S., Khoussainov, B.: Complexity of theories of computable categorical models. Algebra Logic 43(6), 365–373 (2004)
Marker, D.: Non-Σ n -axiomatizable almost strongly minimal theories. J. Symbolic Logic 54, 921–927 (1989)
Fokina, E.: On complexity of categorical theories with computable models. Vestnik NGU 5(2), 78–86 (2005)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol. 144, North-Holland Publishing Co., Amsterdam (2000)
Ash, C.J., Knight, J.F.: Pairs of recursive structures. Ann. Pure Appl. Logic 46(3), 211–234 (1990)
Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic 136(3), 219–246 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fokina, E.B. (2007). Index Sets of Computable Structures with Decidable Theories. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)