2000 character limit reached
Realizability Models Separating Various Fan Theorems
Published 7 Oct 2015 in math.LO | (1510.02147v1)
Abstract: We develop a realizability model in which the realizers are the reals not just Turing computable in a fixed real but rather the reals in a countable ideal of Turing degrees. This is then applied to prove several separation results involving variants of the Fan Theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper.