A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y⊆ω, the minimum ω-model containing Y of RCA0 + S is HYP, the ω-model consisting of the sets hyperarithmetic in Y. We provide an example of a mathematical theorem which is a statement of hyperarithmetic analysis. This statement, that we call INDEC, is due to Jullien [13]. To the author's knowledge, no other already published, purely mathematical statement has been found with this property (...) until now. We also prove that, over RCA0, INDEC is implied by [Formula: see text] and implies ACA0, but of course, neither ACA0, nor ACA 0+ imply it. We introduce five other statements of hyperarithmetic analysis and study the relations among them. Four of them are related to finitely-terminating games. The fifth one, related to iterations of the Turing jump, is strictly weaker than all the other statements that we study in this paper, as we prove using Steel's method of forcing with tagged trees. (shrink)

We prove two results about the embeddability relation between Borel linear orders: For $\eta$ a countable ordinal, let $2^\eta$ (resp. $2^{<\eta}$) be the set of sequences of zeros and ones of length $\eta$ (resp. $<\eta$), equipped with the lexicographic ordering. Given a Borel linear order $X$ and a countable ordinal $\xi$, we prove the following two facts. (a) Either $X$ can be embedded (in a $\triangle^1_1(X,\xi)$ way) in $2^{\omega\xi}$, or $2^{\omega\xi + 1}$ continuously embeds in $X$. (b) Either $X$ can (...) embedded (in a $\triangle^1_1(X,\xi)$ way) in $2^{\omega\xi}$, or $2^{\omega\xi}$ continuously embeds in $X$. These results extend previous work of Harrington, Shelah and Marker. (shrink)