Type 4 is not computable
Japheth Wood
math.RAarXiv:math/9611224
Abstract
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.
Create a lesson
Related papers
Free Novikov-Zinbiel algebra
A. Dauletiyarova, F. Mashurov, B. Sartayev
Very good gradings on structural matrix rings
Patrik Lundström, Johan Öinert, Laura Orozco et al.
Relation graphs of the sedenion algebra
Alexander Guterman, Svetlana Zhilina
On doubly alternative zero divisors in Cayley-Dickson algebras
Svetlana Zhilina
Diameter of the commutativity graph of the real sedenions
Svetlana Zhilina
Functional identities of degree 2 at two-sided zero products on incidence algebras
Hongyu Jia, Zhankui Xiao