Type 4 is not computable
环与代数
2009-09-25 v1
摘要
We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.
引用
@article{arxiv.math/9611224,
title = {Type 4 is not computable},
author = {Japheth Wood},
journal= {arXiv preprint arXiv:math/9611224},
year = {2009}
}