Subtraces and shadow chains

DOI10.1007/S000120050113MaRDI QIDQ5932481zbMATH OpenOpenAlexFDO

Authors J. Wood

Publication date 10 June 2001

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000120050113

zbMATH Keywords

decidabilityshadow chainsubtracetame congruence theory

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Equational logic, Mal'tsev conditions (08B05) Free algebras (08B20)

Review text

For types, the following partial order is considered: \(1<2<3\) and \(1<5<4<3\) (where 2 and 5 or 2 and 4 are incomparable). Theorem. Let \(B\) be a finite algebra in a variety \(\mathcal V\) and suppose that type \(\{ S(B)\}\) omits all types strictly less than a given type \(i\). Then \(i\in \text{typ}(B)\) implies that \(i\) belongs to types of the free algebra of \(\mathcal V\) with two free generators. As a corollary the author obtains an answer to a question posed by R. N. McKenzie: Let \({\mathcal V}(A)\) be the variety generated by the finite algebra \(\mathcal A\). If \({\mathcal V}(A)\) omits 1 from its typeset, then it is decidable if 5 occurs in type \(\{ {\mathcal V} (A)\}\).

Recommendations

• Some results on addition/subtraction chains
• scientific article; zbMATH DE number 6052309
• Sub-shadowings
• Shadowing with chain transitivity
• scientific article; zbMATH DE number 3998771
• Chain transitivity and variations of the shadowing property
• An application of a subordination chain
• On the construction of short addition-subtraction chains and their applications
• Chains of subsemigroups

This page was built for publication: Subtraces and shadow chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932481)