Tracking chains revisited

DOI10.1142/9789813223523_0008MaRDI QIDQ5137320zbMATH OpenOpenAlexFDO

Publication date 2 December 2020

Published in Sets and Computations (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.04348

Recursive ordinals and ordinal notations (03F15)

Abstract: The structure

{c a l C}_{2} := (1^{i} n f t y, l e, l e_{1}, l e_{2})

, introduced and first analyzed in Carlson and Wilken 2012 (APAL), is shown to be elementary recursive. Here,

1^{i} n f t y

denotes the proof-theoretic ordinal of the fragment

P i_{1}^{1}

-

m a t h r m {C A}_{0}

of second order number theory, or equivalently the set theory

m a t h r m {K P l}_{0}

, which axiomatizes limits of models of Kripke-Platek set theory with infinity. The partial orderings

l e_{1}

and

l e_{2}

denote the relations of

S i g m a_{1}

- and

S i g m a_{2}

-elementary substructure, respectively. In a subsequent article we will show that the structure

{c a l C}_{2}

comprises the core of the structure

{c a l R}_{2}

of pure elementary patterns of resemblance of order

2

. 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

2

is

1^{i} n f t y

. However, it is not obvious from Carlson and Wilken 2012 (APAL) that

{c a l C}_{2}

is an elementary recursive structure. This is shown here through a considerable disentanglement in the description of connectivity components of

l e_{1}

and

l e_{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

{c a l C}_{2}

.

Recommendations

Cited in

(7)

This page was built for publication: Tracking chains revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137320)