Residual finiteness in permutation varieties of semigroups

DOI10.1007/BF02572638zbMath0552.20041MaRDI QIDQ801042

Thomas E. Nordahl

Publication date: 1985

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

Full work available at URL: https://eudml.org/doc/134735

zbMATH Keywords

word problemcongruence latticeresidually finitecongruencepermutation identitiesvariety of semigroupsfinitely presentedvarieties of associative algebrasfinitely generatedlocally representablelocally Hopfianlocally Noetherianpermutation varieties of semigroups

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Rings with polynomial identity (16Rxx)

Related Items

Operation inducing systems, On permutative semigroup algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finitely generated left commutative semigroups are residually finite
• Finite basis theorem for systems of semigroup identities
• A note on residually small varieties of semigroups
• New decision algorithms for finitely presented commutative semigroups
• Residually small varieties of semigroups
• On monoids presented by a single relation
• Locally finitely approximable and locally representable varieties of algebras
• Some properties of the product of varieties of associative algebras
• Semigroups and their lattice of congruences. II
• Generalization of the Hilbert theorem on the finiteness of bases
• Residual finiteness of finitely generated commutative semigroups
• Homomorphisms and subdirect decompositions of semigroups
• Rational sets in commutative monoids
• Residual finiteness and the Hopf property in rings
• The lattice of semigroup varieties
• On nilpotency and residual finiteness in semigroups
• Residually small varieties
• Arithmetical and semihereditary semigroup rings
• A Matrix Representation for Associative Algebras. II
• Word problems
• On the decidability of some problems in special classes of groups
• Computational algorithms for deciding some problems for nilpotent groups
• Finitely Presented Loops, Lattices, etc. are Hopfian
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Shorter Notes: Redei's Finiteness Theorem for Commutative Semigroups
• Residually Finite Semigroups of Endomorphisms
• VARIETIES OF FINITELY APPROXIMABLE GROUPS
• On a Theorem of Malcev
• On Infinite Soluble Groups (III)
• The decision problem for some classes of sentences without quantifiers
• Varieties of associative algebras