Turing Schmerl Logic for Graded Turing Progressions

Eduardo Hermo Reyes, Joost J. Joosten · arXiv (Cornell University) · 2016

Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates valid principles that hold between the different Turing progressions. The logic is proven to be sound and some relations between this logic and Reflection Calculus are shown. This is a draft version and shortly a more complete version will be published.

Read the paper · More papers on PaperTik