Skip to main content
7 events
when toggle format what by license comment
S Nov 22, 2013 at 10:41 history suggested Sergiy Kozerenko CC BY-SA 3.0
TeX corrections
Nov 22, 2013 at 10:28 review Suggested edits
S Nov 22, 2013 at 10:41
Mar 13, 2010 at 21:23 comment added HJRW Some terminology: if there is an algorithm to solve systems of equations and inequations in a group G, then the universal theory of G is said to be decidable.
Mar 13, 2010 at 17:47 answer added Sam Nead timeline score: 5
Mar 12, 2010 at 23:34 answer added Ian Agol timeline score: 10
Mar 12, 2010 at 22:26 answer added Steve Huntsman timeline score: 5
Mar 12, 2010 at 20:49 history asked David CC BY-SA 2.5