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 the normal view instead:
scientific article; zbMATH DE number 6234003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8161047101020813
0 references
0.8144758939743042
0 references
0.8052829504013062
0 references
0.8035470247268677
0 references
0.8019838333129883
0 references
