Type 4 is not computable
From MaRDI portal
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.
This page was built for publication: Type 4 is not computable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502448)