{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:46:13Z","timestamp":1773143173786,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T00:00:00Z","timestamp":1229040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00153-008-0113-3","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T16:51:11Z","timestamp":1229014271000},"page":"115-140","source":"Crossref","is-referenced-by-count":15,"title":["Space complexity of Abelian groups"],"prefix":"10.1007","volume":"48","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney G.","family":"Downey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zia","family":"Uddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"113_CR1","doi-asserted-by":"crossref","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal M., Kayhal N., Saxena N.: PRIMES is in P. Ann. Math. 160, 781\u2013793 (2004)","journal-title":"Ann. Math."},{"key":"113_CR2","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"P.W. Beame","year":"1986","unstructured":"Beame P.W., Cook S.A., Hoover H.J.: Log depth circuits for division and related problems. SIAM J. Comput. 15, 994\u20131003 (1986)","journal-title":"SIAM J. Comput."},{"key":"113_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.apal.2005.10.002","volume":"141","author":"W. Calvert","year":"2006","unstructured":"Calvert W., Cenzer D., Harizanov V., Morozov A.: $${\\Delta^{0}_{2}}$$ categoricity of equivalence structures. Ann. Pure Appl. Logic 141, 61\u201378 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"113_CR4","unstructured":"Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective Categoricity of Abelian p-Groups, Ann. Pure Appl. Logic (to appear)"},{"key":"113_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"D. Cenzer","year":"1991","unstructured":"Cenzer D., Remmel J.B.: Polynomial-time versus recursive models. Ann. Pure Appl. Logic 54, 17\u201358 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"113_CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"D Cenzer","year":"1992","unstructured":"Cenzer D, Remmel J.B.: Polynomial-time Abelian groups. Ann. Pure Appl. Logic 56, 313\u2013363 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"113_CR7","first-page":"91","volume-title":"Prog. in Comp. Science and Appl. Logic 13","author":"D. Cenzer","year":"1995","unstructured":"Cenzer D., Remmel J.B.: Feasibly categorical Abelian groups, in Feasible Mathematics II. In: Clote, P., Remmel, J. (eds) Prog. in Comp. Science and Appl. Logic 13,, pp. 91\u2013154. Birkh\u00e4user, Basel (1995)"},{"key":"113_CR8","first-page":"300","volume-title":"Logic and Computational Complexity. Springer Lecture Notes in Computer Science, vol. 960","author":"D. Cenzer","year":"1995","unstructured":"Cenzer D., Remmel J.B.: Feasibly categorical models. In: Leivant, D. (eds) Logic and Computational Complexity. Springer Lecture Notes in Computer Science, vol. 960, pp. 300\u2013312. Springer, Berlin (1995)"},{"key":"113_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1997.2676","volume":"140","author":"D. Cenzer","year":"1998","unstructured":"Cenzer D., Remmel J.B.: Complexity and categoricity. Inform. Comput. 140, 2\u201325 (1998)","journal-title":"Inform. Comput."},{"key":"113_CR10","first-page":"381","volume-title":"Handbook of Recursive Mathematics (vol. I), Elsevier Studies in Logic and Found. Math., vol. 138.","author":"D. Cenzer","year":"1998","unstructured":"Cenzer D., Remmel J.B.: Complexity-theoretic model theory and algebra. In: Ershov, Y., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds) Handbook of Recursive Mathematics (vol. I), Elsevier Studies in Logic and Found. Math., vol. 138., pp. 381\u2013513. Elsevier, Amsterdam (1998)"},{"key":"113_CR11","unstructured":"Cenzer, D., Uddin, Z.: Space complexity of structures. In: Beckmann, A., Berger, U., Loewe, B., Tucker, J. (eds.) Proc. CIE 2006 (Computability in Europe, Swansea, June 2006). Springer Lecture Notes in Computer Science, vol. 3988, pp. 55\u201364. Springer, Berlin (2006)"},{"key":"113_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita:2001119","volume":"35","author":"A. Chiu","year":"2001","unstructured":"Chiu A., Davida G., Litow B.: Division in logspace-uniform NC 1. Theor. Inform. Appl. 35, 259\u2013275 (2001)","journal-title":"Theor. Inform. Appl."},{"key":"113_CR13","doi-asserted-by":"crossref","first-page":"260","DOI":"10.2307\/2274966","volume":"55","author":"S. Grigorieff","year":"1990","unstructured":"Grigorieff S.: Every recursive linear ordering has a copy in DTIME(n). J. Symbolic Logic 55, 260\u2013276 (1990)","journal-title":"J. Symbolic Logic"},{"key":"113_CR14","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft J.E., Ullman J.D.: Formal Languages and their Relation to Automata. Addison- Wesley, Reading (1969)"},{"key":"113_CR15","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading (1998)"},{"key":"113_CR16","first-page":"1431","volume":"3","author":"A.I. Mal\u2019tsev","year":"1962","unstructured":"Mal\u2019tsev A.I.: On recursive abelian groups. Sov. Math.-Doklady 3, 1431\u20131434 (1962)","journal-title":"Sov. Math.-Doklady"},{"key":"113_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0168-0072(89)90047-X","volume":"44","author":"A. Nerode","year":"1989","unstructured":"Nerode A., Remmel J.B.: Complexity-theoretic algebra II: Boolean algebras. Ann. Pure Appl. Logic 44, 71\u201379 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"113_CR18","unstructured":"Nerode A., Remmel J.B.: Polynomial time equivalence types. In: Sieg, W. (ed.) Logic and computation. Contemp. Math. 106, 221\u2013249 (1990)"},{"key":"113_CR19","first-page":"323","volume-title":"Recursion Theory Week (Oberwolfach 1989). Springer Lecture Notes in Math., vol. 1432","author":"A. Nerode","year":"1990","unstructured":"Nerode A., Remmel J.B.: Polynomially isolated sets. In: Ambos-Spies, K., Muller, G.H., Sacks, G.E. (eds) Recursion Theory Week (Oberwolfach 1989). Springer Lecture Notes in Math., vol. 1432, pp. 323\u2013362. Springer, Berlin (1990)"},{"key":"113_CR20","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou C.H.: Computational Complexity. Addison-Wesley, Reading (1995)"},{"key":"113_CR21","first-page":"302","volume-title":"Two theorems on autostability in p-groups, Logic Year 1979\u201380 (Storrs, CT), Lecture Notes in Math., vol. 859","author":"R. Smith","year":"1981","unstructured":"Smith R.: Two theorems on autostability in p-groups, Logic Year 1979\u201380 (Storrs, CT), Lecture Notes in Math., vol. 859, pp. 302\u2013311. Springer, Berlin (1981)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0113-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0113-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0113-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:36:42Z","timestamp":1558640202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0113-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,12]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0113-3","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,12]]}}}