Abstract
We show that for every sofic chunk E there is a bijective homomorphism \(f:E_c \rightarrow E\), where \(E_c\) is a chunk of the group of computable permutations of \(\mathbb {N}\) so that the approximating morphisms of E can be viewed as restrictions of permutations of \(E_c\) to finite subsets of \(\mathbb {N}\). Using this we study some relevant effectivity conditions associated with sofic chunks and their profiles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arzhantseva, G., Cherix, P-A.: Quantifying metric approximations of discrete groups. arXiv:2008.12954
Capraro, V., Lupini, M.: Introduction to Sofic and Hyperlinear Groups and Connes’ Embedding Conjecture. With an Appendix by Vladimir Pestov. Lecture Notes in Mathematics, 2136. Springer, Cham (2015)
Cavaleri, M.: Algorithms and quantifications in amenable and sofic groups. Ph.d., thesis, Sapienza Universita di Roma (2016)
Cavaleri, M.: Computability of Folner sets. Int. J. Algebra Comput. 27, 819–830 (2017)
Cavaleri, M.: Folner functions and the generic word problem for finitely generated amenable groups. J. Algebra 511, 388–404 (2018)
de Cornulier, Y.: Sofic profiles and computability of Cremona groups. Mich. Math. J. 62, 823–841 (2013)
Elek, G., Szabo, E.: Hyperlinearity, essentially free actions and \(L^2\)-invariants. The sofic property. Math. Ann. 332, 421–441 (2005)
Ershov, Y.L.: Decision Problems and Constructivizable Models. Nauka, Moscow (Russian) (1980)
Hołubowski, W.: A new measure of growth for groups and algebras. Algebra i Analiz 19, 69–91 (2007). (Russian)
Khoussainov, B., Miasnikov, A.G.: Finitely presented expansions of groups, semigroups, and algebras. Trans. Am. Math. Soc. 366, 1455–1474 (2014)
Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Reprint of the 1977 edition. Classics in Mathematics. Springer, Berlin (2001)
Morozov, A.S.: Translation in Higman’s question revisited. Algebra Log. 39:78–83 (2000)
Nies, A., Sorbi, A.: Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28, 457–471 (2018)
Odifreddi, P.G.: Classical recursion Theory. The theory of functions and sets of natural numbers. With a foreword by G.E. Sacks. Studies in Logic and the Foundations of Mathematics, 125, North-Holland Publishing Co., Amsterdam (1989)
Pestov, V.: Hyperlinear and sofic groups: a brief guide. Bull. Symb. Log. 14, 449–480 (2008)
Soare, R.I.: Turing computability. Theory and applications. Springer-Verlag, Berlin (2016)
Thomas, S.: On the number of universal sofic groups. Proc. Am. Math. Soc. 138, 2585–2590 (2010)
Acknowledgements
The author is grateful to the anonymous referee for his thorough and essential remarks.
Funding
Not applicable.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Not applicable.
Availability of data and materials
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Code availability
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ivanov, A. Sofic profiles of \(S(\omega )\) and computability. Arch. Math. Logic 60, 477–494 (2021). https://doi.org/10.1007/s00153-020-00757-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-020-00757-0