Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:iris.uniroma1.it:11573/139122

Unprovability results involving braids

Authors
Publication date
1 January 2011
Publisher
Cambridge University Press / New York:40 West 20th Street:New York, NY 10011:(800)872-7423, (212)924-3900, EMAIL: [email protected], INTERNET: http://www.journals.cambridge.org, Fax: (212)691-3239
Doi

    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 not provable in the subsystems σ1or σ2of the standard Peano system (although they are provable in stronger systems of arithmetic). © 2010 London Mathematical Society

    Similar works

    Full text

    thumbnail-image

    Archivio della ricerca- Università di Roma La Sapienza

    redirect
    oaioai:iris.uniroma1.it:11573/139...
    Last time updated on 12/11/2016

    This paper was published in Archivio della ricerca- Università di Roma La Sapienza.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.