Source: J. Symbolic Logic Volume 76, Issue 2
(2011), 561-574.
Jullien's indecomposability theorem (INDEC) states that if a scattered
countable linear order is indecomposable, then it is either
indecomposable to the left, or indecomposable to the right. The
theorem was shown by Montalbán to be a theorem of
hyperarithmetic analysis, and then, in the base system
RCA₀ plus Σ¹₁ induction, it was shown by Neeman to
have strength strictly between weak Σ¹₁ choice and
Δ¹₁ comprehension. We prove in this paper that
Σ¹₁ induction is needed for the reversal of INDEC, that
is for the proof that INDEC implies weak Σ¹₁ choice. This
is in contrast with the typical situation in reverse mathematics,
where reversals can usually be refined to use only Σ⁰₁
induction.
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription.
Read more about accessing full-text
References
Denis R. Hirschfeldt and Richard A. Shore, Combinatorial principles weaker than Ramsey's theorem for pairs, Journal of Symbolic Logic, vol. 72 (2007), no. 1, pp. 171–206.
Pierre Jullien, Contribution à l'étude des types d'ordre dispersés, Ph.D. thesis, Marseille, 1969.
MedYahya Ould MedSalem and Kazuyuki Tanaka, $\Delta\sp 0\sb 3$-determinacy, comprehension and induction, Journal of Symbolic Logic, vol. 72 (2007), no. 2, pp. 452–462.
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis, Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120.
––––, On the equimorphism types of linear orderings, Bulletin of Symbolic Logic, vol. 13(2007), no. 1, pp. 71–99.
Itay Neeman, The strength of Jullien's indecomposability theorem, Journal of Mathematical Logic, vol. 8 (2009), no. 1, pp. 93–119.
Takako Nemoto, Determinacy of Wadge classes and subsystems of second order arithmetic, Mathematical Logic Quarterly, vol. 55 (2009), no. 2, pp. 154–176.
Stephen G. Simpson, $\Sigma \sp1\sb1$ and $\Pi \sp1\sb1$ transfinite induction, Logic Colloquium '80 (Prague, 1980), Studies in Logic and the Foundations of Mathematics, vol. 108, North-Holland, Amsterdam, 1982, pp. 239–253.
Mathematical Reviews (MathSciNet):
MR673796
––––, Subsystems of second order arithmetic, second ed., Perspectives in Logic, Cambridge University Press, Cambridge, 2009.
John R. Steel, Determinateness and subsystems of analysis, Ph.D. thesis, University of California, Berkeley, 1977.
––––, Forcing with tagged trees, Annals of Mathematical Logic, vol. 15(1978), no. 1, pp. 55–74.
Robert Van Wesep, Subsystems of second-order arithmetic, and descriptive set theory under the axiom of determinateness, Ph.D. thesis, University of California, Berkeley, 1977.
