On decidability of amenability in computable groups

IF 0.3 4区数学 Q1 Arts and Humanities

Archive for Mathematical Logic Pub Date : 2022-03-03 DOI:10.1007/s00153-022-00819-5

Karol Duda, Aleksander Ivanov

引用次数: 3

Abstract

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.

查看原文本刊更多论文

论可计算群适应性的可决性

本文的主要结果表明，存在一个具有可决字问题的有限呈现群G，其中G的有限子集产生可服从子群的检测是不可决的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Archive for Mathematical Logic MATHEMATICS-LOGIC

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： 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.