Back to Search
Start Over
Unprovability results involving braids
- Publication Year :
- 2007
-
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.<br />Comment: 32 pages
- Subjects :
- Mathematics - Logic
03B30, 03F35, 20F36, 91A50
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.0711.3785
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1112/plms/pdq016