Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups (Q384406)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups |
scientific article; zbMATH DE number 6234003
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups |
scientific article; zbMATH DE number 6234003 |
Statements
Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups (English)
0 references
27 November 2013
0 references
partially commutative nilpotent groups
0 references
finite simple graphs
0 references
universal theory
0 references
satisfiability
0 references
algorithmic decidability
0 references
