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

Archive for Mathematical Logic 60 (3-4):477-494 (2021)
  Copy   BIBTEX

Abstract

We show that for every sofic chunk E there is a bijective homomorphism \, where \ is a chunk of the group of computable permutations of \ so that the approximating morphisms of E can be viewed as restrictions of permutations of \ to finite subsets of \. Using this we study some relevant effectivity conditions associated with sofic chunks and their profiles.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2021-01-02

Downloads
9 (#1,266,389)

6 months
2 (#1,445,278)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Hyperlinear and sofic groups: a brief guide.Vladimir G. Pestov - 2008 - Bulletin of Symbolic Logic 14 (4):449-480.

Add more references