Every decidable pseudovariety of abelian groups is completely tame

DOI10.1007/S00233-019-10024-1MaRDI QIDQ2003184zbMATHOpenAlexWikidataFDO

Authors Khadijeh Alibabaei

Publication date 16 July 2019

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.09131

zbMATH Keywords

system of equationspseudovariety of semigroupsrational constraintimplicit signature\(\sigma \)-full pseudovarietycompletely reducible pseudovarietycompletely tame pseudovarietyrelatively free profinite semigroupweakly reducible pseudovariety

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: It has been shown that the proper, non-locally finite pseudovarieties of abelian groups are not tame with respect to the canonical signature. In this paper, we show that every decidable, proper, non-locally finite pseudovariety of abelian groups is completely tame with respect to a further enlarged implicit signature. This theorem yields as a corollary that a pseudovariety of abelian groups is decidable if and only if it is completely tame.

Recommendations

• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• Tameness of joins involving the pseudovariety of local semilattices.
• Tameness of pseudovariety joins involving R.
• TAMENESS OF THE PSEUDOVARIETY LS1
• Tameness of Some Locally Trivial Pseudovarieties

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• scientific article; zbMATH DE number 1416098 (Why is no real title available?)
• Abelian pointlikes of a monoid
• Complete reducibility of systems of equations with respect to \(\mathbf R\).
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• Equations in free groups are not finitely approximable
• Extending partial automorphisms and the profinite topology on free groups
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Integer matrix diagonalization
• Monoid kernels and profinite topologies on the free Abelian group
• ON SEPARABILITY PROPERTIES OF GROUPS
• On some systems of equations with constraints in a free group. -- Addenda.
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• On the profinite topology on negatively curved groups
• PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
• Semidirect product with an order-computable pseudovariety and tameness.
• Solving systems of equations modulo pseudovarieties of Abelian groups and hyperdecidability.
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• Tameness of pseudovariety joins involving R.
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• Undecidability of the identity problem for finite semigroups

Cited in

(7)

• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• Solving systems of equations modulo pseudovarieties of Abelian groups and hyperdecidability.
• The pseudovariety of all nilpotent groups is tame
• TAMENESS OF THE PSEUDOVARIETY LS1
• Profinite topologies
• On algorithmic problems for joins of pseudovarieties

This page was built for publication: Every decidable pseudovariety of abelian groups is completely tame

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