Unprovability results involving braids
Logic
2014-02-26 v1
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.
Keywords
Cite
@article{arxiv.0711.3785,
title = {Unprovability results involving braids},
author = {Lorenzo Carlucci and Patrick Dehornoy and Andreas Weiermann},
journal= {arXiv preprint arXiv:0711.3785},
year = {2014}
}
Comments
32 pages