Layth Al‐Hellawi, Rachael Alvir, Barbara F. Csima, Xinyue Xie
{"title":"沃克取消定理的有效性","authors":"Layth Al‐Hellawi, Rachael Alvir, Barbara F. Csima, Xinyue Xie","doi":"10.1002/malq.202400030","DOIUrl":null,"url":null,"abstract":"Walker's cancellation theorem for abelian groups tells us that if is finitely generated and and are such that , then . Deveau showed that the theorem can be effectivized, but not uniformly. In this paper, we expand on Deveau's initial analysis to show that the complexity of uniformly outputting an index of an isomorphism between and , given indices for , , , the isomorphism between and , and the rank of , is . Moreover, we find that the complexity remains even if the generators in the copies of are specified.","PeriodicalId":49864,"journal":{"name":"Mathematical Logic Quarterly","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effectiveness of Walker's cancellation theorem\",\"authors\":\"Layth Al‐Hellawi, Rachael Alvir, Barbara F. Csima, Xinyue Xie\",\"doi\":\"10.1002/malq.202400030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Walker's cancellation theorem for abelian groups tells us that if is finitely generated and and are such that , then . Deveau showed that the theorem can be effectivized, but not uniformly. In this paper, we expand on Deveau's initial analysis to show that the complexity of uniformly outputting an index of an isomorphism between and , given indices for , , , the isomorphism between and , and the rank of , is . Moreover, we find that the complexity remains even if the generators in the copies of are specified.\",\"PeriodicalId\":49864,\"journal\":{\"name\":\"Mathematical Logic Quarterly\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Logic Quarterly\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/malq.202400030\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Logic Quarterly","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/malq.202400030","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
Walker's cancellation theorem for abelian groups tells us that if is finitely generated and and are such that , then . Deveau showed that the theorem can be effectivized, but not uniformly. In this paper, we expand on Deveau's initial analysis to show that the complexity of uniformly outputting an index of an isomorphism between and , given indices for , , , the isomorphism between and , and the rank of , is . Moreover, we find that the complexity remains even if the generators in the copies of are specified.
期刊介绍：
Mathematical Logic Quarterly publishes original contributions on mathematical logic and foundations of mathematics and related areas, such as general logic, model theory, recursion theory, set theory, proof theory and constructive mathematics, algebraic logic, nonstandard models, and logical aspects of theoretical computer science.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
