This is an abstract and references for a talk to be given at a Dynamical Systems Workshop at the Pennsylvania State University, Department of Mathematics, October 18-21, 2007.
We apply some fundamental concepts and results from mathematical logic in order to obtain an apparently new counterexample in symbolic dynamics. Two sets and are said to be strongly equivalent if there exist partial recursive functionals from into and vice versa. The strong degree of is the equivalence class of under strong equivalence. There is an extensive recursion-theoretic literature on the lattice of strong degrees of nonempty subsets of the Cantor space. This lattice is known as . We prove that consists precisely of the strong degrees of 2-dimensional subshifts of finite type. We use this result to obtain an infinite collection of 2-dimensional subshifts of finite type which are, in a certain sense, mutually incompatible.
This document was generated using the LaTeX2HTML translator Version 2002-2-1 (1.71)
Copyright © 1993, 1994, 1995, 1996,
Nikos Drakos,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999,
Ross Moore,
Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -split 0 abstract
The translation was initiated by Stephen G Simpson on 2007-10-02