Recursive Inseparability for Residual Bounds of Finite Algebras
McKenzie, Ralph
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 1863-1880 / Harvested from Project Euclid
We exhibit a construction which produces for every Turing machine $\mathcal{T}$ with two halting states $\mu_0$ and $\mu_{-1}$, an algebra B($\mathcal{T}$) (finite and of finite type) with the property that the variety generated by B($\mathcal{T}$) is residually large if $\mathcal{T}$ halts in state $\mu_{-1}$, while if $\mathcal{T}$ halts in state $\mu_0$ then this variety is residually bounded by a finite cardinal.
Publié le : 2000-12-14
Classification: 
@article{1183746271,
     author = {McKenzie, Ralph},
     title = {Recursive Inseparability for Residual Bounds of Finite Algebras},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 1863-1880},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746271}
}
McKenzie, Ralph. Recursive Inseparability for Residual Bounds of Finite Algebras. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  1863-1880. http://gdmltest.u-ga.fr/item/1183746271/