The finite basis problem for words with at most two non-linear variables.

DOI10.1007/s00233-016-9799-4zbMath1350.20041arXiv1403.6430OpenAlexW3099273318MaRDI QIDQ305772

Olga Sapir

Publication date: 30 August 2016

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

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

zbMATH Keywords

semigroup varietiesbases of identitiesfree monoidsalphabetsfinite basis problemfinitely based monoidsinherently non-finitely based monoidsisotermsRees quotientssemigroup identities

Mathematics Subject Classification ID

Combinatorics on words (68R15) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items (5)

Varieties of monoids with complex lattices of subvarieties ⋮ LEE MONOIDS ARE NONFINITELY BASED WHILE THE SETS OF THEIR ISOTERMS ARE FINITELY BASED ⋮ Finitely based sets of 2-limited block-2-simple words ⋮ Non-finitely based monoids. ⋮ Finitely based monoids.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-finitely based monoids.
• Finitely based monoids.
• On the axiomatic rank of varieties generated by a semigroup or monoid with one defining relation
• Finiteness properties of varieties and the restriction to finite algebras.
• On the finite basis problem for certain 2-limited words.
• Finitely based sets of 2-limited block-2-simple words
• Bases for equational theories of semi-groups
• FINITELY BASED, FINITE SETS OF WORDS
• THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES
• Polyhedral convex cones and the equational theory of the bicyclic semigroup
• PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
• INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
• FINITELY BASED WORDS
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

This page was built for publication: The finite basis problem for words with at most two non-linear variables.