Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups
From MaRDI portal
(Redirected from Publication:384406)
satisfiabilityuniversal theoryalgorithmic decidabilityfinite simple graphspartially commutative nilpotent groups
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Basic properties of first-order languages and structures (03C07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18) Word problems, etc. in computability and recursion theory (03D40)
Recommendations
- Properties and universal theories for partially commutative nilpotent metabelian groups.
- Embeddability and Universal Theory of Partially Commutative Groups
- Universal equivalence of partially commutative metabelian groups.
- Commuting graphs for partially commutative nilpotent \(\mathbb{Q}\)-groups of class 2.
- On partially commutative groups and the relevant algebras with commutation
Cites work
- scientific article; zbMATH DE number 3652594 (Why is no real title available?)
- scientific article; zbMATH DE number 6304225 (Why is no real title available?)
- scientific article; zbMATH DE number 3415841 (Why is no real title available?)
- Commuting graphs for partially commutative nilpotent \(\mathbb{Q}\)-groups of class 2.
- Model theory
- Universal equivalence of partially commutative metabelian groups.
Cited in
(4)- Embedding of free nilpotent (metabelian) groups in partially commutative nilpotent (metabelian) groups
- On embeddings in the class of partially commutative nilpotent groups
- Properties and universal theories for partially commutative nilpotent metabelian groups.
- On partially commutative groups and the relevant algebras with commutation
This page was built for publication: Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384406)
