Cantor-Bendixson ranks of countable SFTs
Dynamical Systems
2018-03-12 v1 Logic in Computer Science
Abstract
We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form , where 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.
Keywords
Cite
@article{arxiv.1803.03605,
title = {Cantor-Bendixson ranks of countable SFTs},
author = {Ilkka Törmä},
journal= {arXiv preprint arXiv:1803.03605},
year = {2018}
}