{"title":"论可计算群适应性的可决性","authors":"Karol Duda, Aleksander Ivanov","doi":"10.1007/s00153-022-00819-5","DOIUrl":null,"url":null,"abstract":"<div><p>The main result of the paper states that there is a finitely presented group <i>G</i> with decidable word problem where detection of finite subsets of <i>G</i> which generate amenable subgroups is not decidable.</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-022-00819-5.pdf","citationCount":"3","resultStr":"{\"title\":\"On decidability of amenability in computable groups\",\"authors\":\"Karol Duda, Aleksander Ivanov\",\"doi\":\"10.1007/s00153-022-00819-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The main result of the paper states that there is a finitely presented group <i>G</i> with decidable word problem where detection of finite subsets of <i>G</i> which generate amenable subgroups is not decidable.</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00153-022-00819-5.pdf\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-022-00819-5\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-022-00819-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
On decidability of amenability in computable groups
The main result of the paper states that there is a finitely presented group G with decidable word problem where detection of finite subsets of G which generate amenable subgroups is not decidable.
期刊介绍：
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
