Long games on positive braids

Abstract

We introduce two games played on positive braids. The first game is played on 3-strand positive braids and its termination time is Ackermannian in the input. We give an ordinal-theoretic and a model-theoretic proof (using semi-regular cuts in models of arithmetic). The second game is played on arbitrary positive braids and its termination is unprovable in I… (More)

Topics

5 Figures and Tables

Slides referencing similar topics