On decidability of amenability in computable groups

DOI10.1007/s00153-022-00819-5OpenAlexW4214819132MaRDI QIDQ2085571

Yanyan Li

Publication date: 18 October 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-022-00819-5

zbMATH Keywords

amenabilitycomputable groupsintrinsically computable relations

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Computable paradoxical decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On effective Birkhoff's ergodic theorem for computable actions of amenable groups
• Elementary theory of free non-abelian groups.
• Possible degrees in recursive copies. II
• On subgroups of free Burnside groups of large odd exponent.
• Følner functions and the generic word problem for finitely generated amenable groups
• Limit groups as limits of free groups.
• Aspects of free groups.
• Diophantine geometry over groups. I: Makanin-Razborov diagrams
• Subgroup properties of fully residually free groups
• The Banach–Tarski Paradox
• Turing Computability
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• RANDOM WALKS ON FREE PERIODIC GROUPS
• SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
• Group Embeddings with Algorithmic Properties
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Cellular Automata and Groups
• Computability of Følner sets
• The conjugacy problem and Higman embeddings
• Hyperlinear and Sofic Groups: A Brief Guide
• An Embedding Theorem for Finitely Generated Groups
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Groups with the Haagerup property. Gromov's a-T-menability

This page was built for publication: On decidability of amenability in computable groups