TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS

DOI10.1142/S0218196705002311zbMath1083.20045OpenAlexW2012035225MaRDI QIDQ5461668

Manuel Delgado, Jorge Almeida

Publication date: 26 July 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196705002311

zbMATH Keywords

algorithmsfinite Abelian groupsinevitabilitytamenesssemilinear setspseudovarieties of finite semigroupslinear Diophantine systemshyperdecidability

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Finite abelian groups (20K01) Semigroups in automata theory, linguistics, etc. (20M35) Quasivarieties and varieties of groups (20E10) Limits, profinite groups (20E18)

Related Items

Reducibility vs. definability for pseudovarieties of semigroups ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ Complete κ-reducibility of pseudovarieties of the form DRH ⋮ TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES ⋮ Every decidable pseudovariety of abelian groups is completely tame ⋮ COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1 ⋮ The pseudovariety of all nilpotent groups is tame ⋮ Profinite topologies ⋮ Tameness of pseudovariety joins involving R.

Uses Software

• GAP

Cites Work

• Unnamed Item
• Abelian pointlikes of a monoid
• Some key problems on finite semigroups
• Commutative images of rational languages and the Abelian kernel of a monoid
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS