Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10939| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Crvenković S. | en_US |
| dc.contributor.author | Tasić V. | en_US |
| dc.date.accessioned | 2020-03-03T14:42:04Z | - |
| dc.date.available | 2020-03-03T14:42:04Z | - |
| dc.date.issued | 2002-01-01 | - |
| dc.identifier.issn | 14335883 | en_US |
| dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10939 | - |
| dc.description.abstract | Let G be a finitely generated soluble group with solvable word problem. It is known that the equational theory of G need not be decidable. We prove that the semigroup theory of G, that is, the set of identites of G that have the form u = v where u and v are inverse-free, is decidable. | en |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Journal of Group Theory | en |
| dc.title | Decidability of semigroup identities in soluble groups | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.scopus | 2-s2.0-0036101277 | - |
| dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0036101277 | - |
| dc.description.version | Published | en_US |
| dc.relation.lastpage | 118 | en |
| dc.relation.firstpage | 107 | en |
| dc.relation.issue | 1 | en |
| dc.relation.volume | 5 | en |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| Appears in Collections: | PMF Publikacije/Publications | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.