Sets and computations

Table of Contents: “…Larson and Dilip Raghavan -- Cobham recursive set functions and weak set theories / Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller and Neil Thapen -- Higher randomness and lim-sup forcing within and beyond hyperarithmetic / Takayuki Kihara -- Ackermannian Goodstein principles for first order Peano arithmetic / Andreas Weiermann -- Tracking chains revisited / Gunnar Wilken -- Groups with orderings of arbitrary algorithmic complexity / Jennifer Chubb, Mieczyslaw K. …”