\({\Pi^1_2}\)-comprehension and the property of Ramsey (Q1016505)

A set \(X\) of sets of natural numbers is said to have the property of Ramsey if there is an infinite set \(H\) such that either every infinite subset of \(H\) is in \(X\), or every infinite subset of \(H\) is not in \(X\). The author develops an axiom system, called the \(R\)-calculus, for working with the property of Ramsey in subsystems of second-order arithmetic. He shows that the \(R\)-calculus proves the same \(\Pi^1_1\) sentences as the \(\Pi^1_2\) comprehension scheme. This work is based on the author's thesis [\(\Pi^1_2\)-comprehension and the property of Ramsey. Münster: Univ. Münster, Fachbereich Mathematik und Informatik (Dissertation) (2007; Zbl 1140.03039)]. The \(R\)-calculus is related to the \(\mu\)-calculus, which appears in his work with \textit{M. Möllerfeld} [``Determinacy in second order arithmetic'', in: S. Bold et al. (eds.), Foundations of the formal sciences V. Infinite games. Papers of the 5th conference, FotFS V, Bonn, Germany, November 26--29, 2004. London: King's College Publications. Studies in Logic (London) 11, 143--155 (2007; Zbl 1151.03030)].