{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:13:13Z","timestamp":1772752393996,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301001"],"award-info":[{"award-number":["12301001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008343","name":"Beijing Language and Culture University","doi-asserted-by":"publisher","award":["2023YGF09"],"award-info":[{"award-number":["2023YGF09"]}],"id":[{"id":"10.13039\/501100008343","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.tcs.2025.115457","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T13:39:07Z","timestamp":1752586747000},"page":"115457","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computable formal contexts"],"prefix":"10.1016","volume":"1054","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0698-7649","authenticated-orcid":false,"given":"Huishan","family":"Wu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2025.115457_br0020","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2178\/jsl\/1107298523","article-title":"The isomorphism problem for computable Abelian p-groups of bounded length","volume":"70","author":"Calvert","year":"2005","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.tcs.2025.115457_br0030","doi-asserted-by":"crossref","first-page":"3670","DOI":"10.1016\/j.jalgebra.2009.07.039","article-title":"On the complexity of radicals in noncommutative rings","volume":"322","author":"Conidis","year":"2009","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0040","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.jalgebra.2014.02.027","article-title":"Infinite dimensional proper subspaces of computable vector spaces","volume":"406","author":"Conidis","year":"2014","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0050","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-11367-3","article-title":"Reverse Mathematics: Problems, Reductions and Proofs","author":"Dzhafarov","year":"2022"},{"key":"10.1016\/j.tcs.2025.115457_br0060","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.jalgebra.2007.02.058","article-title":"Ideals in computable rings","volume":"314","author":"Downey","year":"2007","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0070","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.jalgebra.2006.08.040","article-title":"Subspaces of computable vector spaces","volume":"314","author":"Downey","year":"2007","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0080","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jalgebra.2012.09.020","article-title":"Effectively categorical abelian groups","volume":"373","author":"Downey","year":"2013","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0090","doi-asserted-by":"crossref","first-page":"4243","DOI":"10.1090\/S0002-9947-2014-06115-1","article-title":"Computable completely decomposable groups","volume":"366","author":"Downey","year":"2014","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.tcs.2025.115457_br0100","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.jalgebra.2008.06.007","article-title":"The isomorphism problem for torsion-free abelian groups is analytic complete","volume":"320","author":"Downey","year":"2008","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2025.115457_br0110","first-page":"407","article-title":"Effective procedures in field theory","volume":"248","author":"Frohlich","year":"1956","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci."},{"key":"10.1016\/j.tcs.2025.115457_br0120","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","year":"1999"},{"key":"10.1016\/j.tcs.2025.115457_br0130","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1017\/S0004972700031014","article-title":"The computational complexity of torsion-freeness of finitely presented groups","volume":"56","author":"Lempp","year":"1997","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.tcs.2025.115457_br0140","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/bsl.2014.32","article-title":"Computable abelian groups","volume":"20","author":"Melnikov","year":"2014","journal-title":"Bull. Symb. Log."},{"key":"10.1016\/j.tcs.2025.115457_br0150","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0003-4843(77)90015-8","article-title":"Recursively enumerable vector spaces","volume":"11","author":"Metakides","year":"1977","journal-title":"Ann. Math. Log."},{"key":"10.1016\/j.tcs.2025.115457_br0160","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0003-4843(79)90011-1","article-title":"Effective content of field theory","volume":"17","author":"Metakides","year":"1979","journal-title":"Ann. Math. Log."},{"key":"10.1016\/j.tcs.2025.115457_br0170","series-title":"Algebra and Logic","first-page":"209","article-title":"Recursion theory and algebra","volume":"vol. 450","author":"Metakides","year":"1975"},{"key":"10.1016\/j.tcs.2025.115457_br0180","series-title":"Computability and Randomness","author":"Nies","year":"2009"},{"key":"10.1016\/j.tcs.2025.115457_br0190","first-page":"341","article-title":"Computable algebra, general theory and theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.tcs.2025.115457_br0200","doi-asserted-by":"crossref","first-page":"3631","DOI":"10.1090\/proc\/12509","article-title":"The decomposablity problem for torsion-free abelian groups is analytic-complete","volume":"143","author":"Riggs","year":"2015","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.tcs.2025.115457_br0210","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/j.tcs.2025.115457_br0220","series-title":"Turing Computability","author":"Soare","year":"2016"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525003950?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525003950?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:26:24Z","timestamp":1772749584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525003950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":21,"alternative-id":["S0304397525003950"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115457","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computable formal contexts","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115457","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115457"}}