Comparing the Effective Content of Subshifts
Logic
2026-05-07 v1
Abstract
Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over another and show that this relation is characterised by Ziegler reducibility between their co-languages. We further investigate a notion of existential closure for subshifts.
Cite
@article{arxiv.2605.04490,
title = {Comparing the Effective Content of Subshifts},
author = {Antonio Nakid Cordero and I. Scott},
journal= {arXiv preprint arXiv:2605.04490},
year = {2026}
}
Comments
Accepted to Computability in Europe 2026; 16 pages