科研之友
微信
新浪微博
Facebook
分享链接
摘要
We construct long sequences of braids that are descending with respect to the standard order of braids ('Dehornoy order'), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements involving the braid order are not provable in the subsystems of the standard Peano system (although they are provable in stronger systems of arithmetic).
- 出版日期2011-1
