Timeline for Finitely presented algebra [closed]
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2021 at 12:52 | history | closed |
abx Christian Remling David Handelman Andy Putman coudy |
Not suitable for this site | |
| Apr 9, 2021 at 16:25 | comment | added | YCor | The argument you have in mind shows it's semidecidable. That is, you have an algorithm which takes two words, and if they represent the same element, eventually says "yes" while if they represent distinct elements, never stops. As already mentioned, it's not always decidable. There are semigroup examples, and much more complicated group examples. | |
| Apr 9, 2021 at 15:35 | review | Close votes | |||
| Apr 13, 2021 at 12:52 | |||||
| Apr 9, 2021 at 15:25 | comment | added | Baudouin Le Charlier | The word algebra here is used more generally for an arbitrary signature. A finitely presented algebra is defined by a pair <G, R> where G is a finite set of "generators" et R is a finite set of pairs of terms built from the generators and the function symbols of the algebra. | |
| Apr 9, 2021 at 15:14 | answer | added | Ben McKay | timeline score: 3 | |
| Apr 9, 2021 at 15:13 | comment | added | Ben McKay | You mean the word problem for finitely presented groups? Or algebras? What sort of algebraic structure? | |
| Apr 9, 2021 at 15:02 | review | First posts | |||
| Apr 9, 2021 at 15:49 | |||||
| Apr 9, 2021 at 15:02 | history | asked | Baudouin Le Charlier | CC BY-SA 4.0 |