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

DOI10.1007/s10469-013-9229-6zbMath1280.20039OpenAlexW2081237392MaRDI QIDQ384406

Alexander V. Treier, Alexei A. Mishchenko

Publication date: 27 November 2013

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-013-9229-6

zbMATH Keywords

satisfiabilityuniversal theoryalgorithmic decidabilityfinite simple graphspartially commutative nilpotent groups

Mathematics Subject Classification ID

Nilpotent groups (20F18) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Basic properties of first-order languages and structures (03C07)

Related Items (1)

On partially commutative groups and the relevant algebras with commutation

Cites Work

• Universal equivalence of partially commutative metabelian groups.
• Model theory
• Commuting graphs for partially commutative nilpotent \(\mathbb{Q}\)-groups of class 2.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups