Amenability and computability

DOI10.1007/S00153-022-00819-5MaRDI QIDQ6316709arXivFDO

Authors A. S. Ivanov

Publication date 4 April 2019

Published in arXiv

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

Mathematics Subject Classification ID

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

arXiv classification

math.GR

Abstract: In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also study complexity of the set of all effective F{o}lner sequences and effective paradoxical decomposition. In the appendix we attach a version of the paper "On decidability of amenability in computable groups" by K. Duda and A. Ivanov which covers Sections 9 and 10 from the previous version.

This page was built for publication: Amenability and computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316709)