Isomorphism of subshifts is a universal countable Borel equivalence relation

DOI10.1007/s11856-009-0022-0zbMath1180.03043OpenAlexW2077516133MaRDI QIDQ839908

John D. Clemens

Publication date: 3 September 2009

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-009-0022-0

zbMATH Keywords

Polish spaceBorel equivalence relationsubshift

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Related Items (9)

Topological isomorphism for rank-1 systems ⋮ On the complexity of topological conjugacy of Toeplitz subshifts ⋮ The complexity of the topological conjugacy problem for Toeplitz subshifts ⋮ Quotients by countable normal subgroups are hyperfinite ⋮ CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES ⋮ Group Colorings and Bernoulli Subflows ⋮ Topological full groups of minimal subshifts and the classification problem for finitely generated complete groups ⋮ Isomorphism and weak conjugacy of free Bernoulli subflows ⋮ The complexity of topological conjugacy of pointed Cantor minimal systems

Cites Work

• Unnamed Item
• The Structure of Hyperfinite Borel Equivalence Relations
• COUNTABLE BOREL EQUIVALENCE RELATIONS
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: Isomorphism of subshifts is a universal countable Borel equivalence relation