English

Tracking chains revisited

Logic 2017-10-09 v3

Abstract

The structure C2:=(1,,1,2){\cal C}_2:=(1^\infty,\le,\le_1,\le_2), introduced and first analyzed in Carlson and Wilken 2012 (APAL), is shown to be elementary recursive. Here, 11^\infty denotes the proof-theoretic ordinal of the fragment Π11\Pi^1_1-CA0\mathrm{CA}_0 of second order number theory, or equivalently the set theory KPl0\mathrm{KPl}_0, which axiomatizes limits of models of Kripke-Platek set theory with infinity. The partial orderings 1\le_1 and 2\le_2 denote the relations of Σ1\Sigma_1- and Σ2\Sigma_2-elementary substructure, respectively. In a subsequent article we will show that the structure C2{\cal C}_2 comprises the core of the structure R2{\cal R}_2 of pure elementary patterns of resemblance of order 22. In Carlson and Wilken 2012 (APAL) the stage has been set by showing that the least ordinal containing a cover of each pure pattern of order 22 is 11^\infty. However, it is not obvious from Carlson and Wilken 2012 (APAL) that C2{\cal C}_2 is an elementary recursive structure. This is shown here through a considerable disentanglement in the description of connectivity components of 1\le_1 and 2\le_2. The key to and starting point of our analysis is the apparatus of ordinal arithmetic developed in Wilken 2007 (APAL) and in Section 5 of Carlson and Wilken 2012 (JSL), which was enhanced in Carlson and Wilken 2012 (APAL) specifically for the analysis of C2{\cal C}_2.

Cite

@article{arxiv.1611.04348,
  title  = {Tracking chains revisited},
  author = {Gunnar Wilken},
  journal= {arXiv preprint arXiv:1611.04348},
  year   = {2017}
}

Comments

The text was edited and aligned with reference [10], Lemma 5.11 was included (moved from [10]), results unchanged. Corrected Def. 5.2 and Section 5.3 on greatest immediate $\le_1$-successors. Updated publication information. arXiv admin note: text overlap with arXiv:1608.08421

R2 v1 2026-06-22T16:51:20.968Z