Skip to main content Accessibility help

Necessary use of induction in a reversal

  • Itay Neeman (a1)


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 RCA0 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.



Hide All
[1]Hirschfeldt, Denis R. and Shore, Richard A., Combinatorial principles weaker than Ramsey's theorem for pairs, this Journal, vol. 72 (2007), no. 1, pp. 171206.
[2]Jullien, Pierre, Contribution à l'étude des types d'ordre dispersés, Ph.D. thesis, Marseille, 1969.
[3]Medsalem, Medyahya Ould and Tanaka, Kazuyuki, -determinacy, comprehension and induction, this Journal, vol. 72 (2007), no. 2, pp. 452462.
[4]Montalbán, Antonio, Indecomposable linear orderings and hyperarithmetic analysis, Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89120.
[5]Montalbán, Antonio, On the equimorphism types of linear orderings, The Bulletin of Symbolic Logic, vol. 13 (2007), no. 1, pp. 7199.
[6]Neeman, Itay, The strength of Jullien's indecomposability theorem, Journal of Mathematical Logic, vol. 8 (2009), no. 1, pp. 93119.
[7]Nemoto, Takako, Determinacy of Wadge classes and subsystems of second order arithmetic, Mathematical Logic Quarterly, vol. 55 (2009), no. 2, pp. 154176.
[8]Simpson, Stephen G., and transfinite induction, Logic Colloquium '80(Prague, 1980), Studies in Logic and the Foundations of Mathematics, vol. 108, North-Holland, Amsterdam, 1982, pp. 239253.
[9]Simpson, Stephen G., Subsystems of second order arithmetic, second ed., Perspectives in Logic, Cambridge University Press, Cambridge, 2009.
[10]Steel, John R., Determinateness and subsystems of analysis, Ph.D. thesis, University of California, Berkeley, 1977.
[11]Steel, John R., Forcing with tagged trees, Annals of Mathematical Logic, vol. 15 (1978), no. 1, pp. 5574.
[12]Wesep, Robert Van, Subsystems of second-order arithmetic, and descriptive set theory under the axiom of determinateness, Ph.D. thesis, University of California, Berkeley, 1977.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed