Every decidable pseudovariety of abelian groups is completely tame

DOI10.1007/S00233-019-10024-1zbMATH Open1442.20033arXiv1707.09131OpenAlexW2963113452WikidataQ127944136 ScholiaQ127944136MaRDI QIDQ2003184FDOQ2003184

Khadijeh Alibabaei

Publication date: 16 July 2019

Published in: Semigroup Forum (Search for Journal in Brave)

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.

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

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

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)

Cites Work

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

Cited In (5)

• TAMENESS OF THE PSEUDOVARIETY LS1
• On algorithmic problems for joins of pseudovarieties
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• Profinite topologies
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS

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)