The _monadic theory of the real line_ is the set of all sentences in the [monadic second-order language](https://en.wikipedia.org/wiki/Monadic_second-order_logic) of order which are true in $\mathbb{R}$.  In [this 1982 paper](https://www.sciencedirect.com/science/article/pii/0003484382900043), Gurevich and Shelah show that true first-order arithmetic is Turing-reducible to the monadic theory of the real line.  (Shelah first showed it in the 1970's, but his original result assumed the continuum hypothesis.)   But my question is, what is the Turing degree of the monadic theory of the real line?

Clearly the monadic theory of the real line is Turing reducible to true third-order arithmetic, but how does it compare to true second-order arithmetic, for instance?