✦ LIBER ✦

Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups

✍ Scribed by A. A. Mishchenko, A. V. Treier

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal equivalence of partially commu

✍ A. A. Mishchenko; E. I. Timoshenko 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 184 KB

On the decidability of the equivalence p

✍ Stefano Varricchio 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Structure of the automorphism group for

✍ V. N. Remeslennikov; A. V. Treier 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 367 KB

On the Decidability of Some Problems in

✍ Review by: F. B. Cannonito 📂 Article 📅 1970 🏛 Association for Symbolic Logic 🌐 English ⚖ 369 KB