Sofic profiles of \(S(\omega)\) and computability

DOI10.1007/s00153-020-00757-0OpenAlexW3120639392MaRDI QIDQ2663344

Yanyan Li

Publication date: 16 April 2021

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

Full work available at URL: https://arxiv.org/abs/2001.02648

zbMATH Keywords

sofic groupsgroups of permutationscomputable permutations

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Subgroups of symmetric groups (20B35) Theory of numerations, effectively presented structures (03D45)

Related Items

Computable paradoxical decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• On the Cayley graph of a generic finitely presented group
• Classical recursion theory. The theory of functions and sets of natural numbers
• Combinatorial group theory.
• Følner functions and the generic word problem for finitely generated amenable groups
• Hyperlinearity, essentially free actions and \(L^2\)-invariants. The sofic property
• Introduction to sofic and hyperlinear groups and Connes' embedding conjecture. With an appendix by Vladimir Pestov
• Sofic profile and computability of Cremona groups
• Turing Computability
• A new measure of growth for groups and algebras
• On the number of universal sofic groups
• Computability of Følner sets
• Finitely presented expansions of groups, semigroups, and algebras
• Hyperlinear and Sofic Groups: A Brief Guide