Timeline for Is the class of power-associative binars finitely axiomatizable?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2020 at 2:41 | answer | added | Keith Kearnes | timeline score: 7 | |
| Jun 7, 2020 at 5:08 | history | became hot network question | |||
| Jun 7, 2020 at 0:13 | vote | accept | user107952 | ||
| Jun 6, 2020 at 23:17 | answer | added | YCor | timeline score: 14 | |
| Jun 6, 2020 at 23:05 | history | edited | YCor |
edited tags; edited tags
|
|
| Jun 6, 2020 at 22:46 | answer | added | user158834 | timeline score: 2 | |
| Jun 6, 2020 at 22:40 | comment | added | Gerhard Paseman | Try the following for a counterexample. Let an algebra be generated by x and have standard power arithmetic up to n. Then, whenever two items have exponents which sum to a prime bigger than n, let the kth power times the jth power be equal to a symbolic term x to the power (k,j). In multiplying these, you can collapse the products as you like, as long as you keep (k,j) distinct from (j,k). Gerhard "Always Look For Prime Examples" Paseman, 2020.06.06. | |
| Jun 6, 2020 at 21:55 | comment | added | Gerhard Paseman | I can think of some two variable identities that would imply power associativity, but would be strictly stronger. Are you sure a finite basis exists? Gerhard "Trying Not To Get Hyper" Paseman, 2020.06.06. | |
| Jun 6, 2020 at 20:59 | history | asked | user107952 | CC BY-SA 4.0 |