2000 character limit reached
Cantor-Bendixson ranks of countable SFTs (1803.03605v1)
Published 2 Mar 2018 in math.DS and cs.LO
Abstract: We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form $\lambda + 3$, where $\lambda$ is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.