{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:17Z","timestamp":1725487997986},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_30","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"290-296","source":"Crossref","is-referenced-by-count":0,"title":["Index Sets of Computable Structures with Decidable Theories"],"prefix":"10.1007","author":[{"given":"Ekaterina B.","family":"Fokina","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00153-004-0219-1","volume":"75","author":"W. Calvert","year":"2004","unstructured":"Calvert, W.: The isomorphism problem for classes of computable fields. Archive for Mathematical Logic\u00a075, 327\u2013336 (2004)","journal-title":"Archive for Mathematical Logic"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2178\/jsl\/1107298523","volume":"70","author":"W. Calvert","year":"2005","unstructured":"Calvert, W.: The isomorphism problem for computable Abelian p-groups of bounded length. Journal of Symbolic Logic\u00a070, 331\u2013345 (2005)","journal-title":"Journal of Symbolic Logic"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1023\/B:ALLO.0000048827.30718.2c","volume":"43","author":"W. Calvert","year":"2004","unstructured":"Calvert, W., Cummins, D., Knight, J.F., Miller, S.: Comparing classes of finite structures. Algebra and Logic\u00a043, 374\u2013392 (2004)","journal-title":"Algebra and Logic"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s10469-006-0029-0","volume":"45","author":"W. Calvert","year":"2006","unstructured":"Calvert, W., Harizanov, V., Knight, J.F., Miller, S.: Index sets of computable structures. Algebra and Logic\u00a045, 306\u2013325 (2006)","journal-title":"Algebra and Logic"},{"key":"30_CR5","unstructured":"Csima, B.F., Montalb\u00e1n, A., Shore, R.A.: Boolean algebras, Tarski invariants, and index sets. In the Notre Dame Journal of Formal Logic (to appear)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01979674","volume":"22","author":"V.P. Dobritsa","year":"1983","unstructured":"Dobritsa, V.P.: Complexity of the index set of a constructive model. Algebra and Logic\u00a022, 269\u2013276 (1983)","journal-title":"Algebra and Logic"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1021758312697","volume":"41","author":"S.S. Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra and Logic (English translation)\u00a041, 351\u2013373 (2002)","journal-title":"Algebra and Logic, (English translation)"},{"key":"30_CR8","unstructured":"Lempp, S., Slaman, T.: The complexity of the index sets of \n                  \n                    \n                  \n                  $\\aleph_{0}$\n                -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\u201310, (2004)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1002\/malq.200310066","volume":"49","author":"W. White","year":"2003","unstructured":"White, W.: On the complexity of categoricity in computable structures. Mathematical Logic Quarterly\u00a049, 603\u2013614 (2003)","journal-title":"Mathematical Logic Quarterly"},{"key":"30_CR10","unstructured":"White, W.: Characterizations for Computable Structures, PhD dissertation, Cornell University (2000)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Fokina, E.: Index sets of decidable models, Sibirsk. Mat. Zh (To appear)","DOI":"10.1007\/s11202-007-0097-y"},{"issue":"6","key":"30_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/B:ALLO.0000048826.92325.02","volume":"43","author":"S. Goncharov","year":"2004","unstructured":"Goncharov, S., Khoussainov, B.: Complexity of theories of computable categorical models. Algebra Logic\u00a043(6), 365\u2013373 (2004)","journal-title":"Algebra Logic"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"921","DOI":"10.2307\/2274752","volume":"54","author":"D. Marker","year":"1989","unstructured":"Marker, D.: Non-\u03a3\n                \n                  n\n                -axiomatizable almost strongly minimal theories. J. Symbolic Logic\u00a054, 921\u2013927 (1989)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"30_CR14","first-page":"78","volume":"5","author":"E. Fokina","year":"2005","unstructured":"Fokina, E.: On complexity of categorical theories with computable models. Vestnik NGU\u00a05(2), 78\u201386 (2005)","journal-title":"Vestnik NGU"},{"key":"30_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"30_CR16","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"C.J. Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a0144, North-Holland Publishing Co., Amsterdam (2000)"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(90)90004-L","volume":"46","author":"C.J. Ash","year":"1990","unstructured":"Ash, C.J., Knight, J.F.: Pairs of recursive structures. Ann. Pure Appl. Logic\u00a046(3), 211\u2013234 (1990)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.apal.2005.02.001","volume":"136","author":"S. Goncharov","year":"2005","unstructured":"Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic\u00a0136(3), 219\u2013246 (2005)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:10:35Z","timestamp":1550477435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}