Unprovability results involving braids Export

@misc{citeulike:1999804, abstract = {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 true, but not provable in the subsystems ISigma1 or ISigma2 of the standard Peano system.}, archivePrefix = {arXiv}, author = {Carlucci, Lorenzo and Dehornoy, Patrick and Weiermann, Andreas}, citeulike-article-id = {1999804}, citeulike-linkout-0 = {http://arxiv.org/abs/0711.3785v1}, citeulike-linkout-1 = {http://arxiv.org/pdf/0711.3785v1}, eprint = {0711.3785v1}, keywords = {braids, math, unprovability}, month = {Nov}, posted-at = {2007-12-11 09:12:51}, priority = {2}, title = {Unprovability results involving braids}, url = {http://arxiv.org/abs/0711.3785v1}, year = {2007} }

TY - ELEC ID - citeulike:1999804 L3 - citeulike-article-id:1999804 N2 - 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 true, but not provable in the subsystems ISigma1 or ISigma2 of the standard Peano system. TI - Unprovability results involving braids KW - braids KW - math KW - unprovability AU - Carlucci, Lorenzo AU - Dehornoy, Patrick AU - Weiermann, Andreas PY - 2007/Nov/23/ UR - http://arxiv.org/abs/0711.3785v1 ER -