Tracking chains of \(\varSigma_2\)-elementarity (Q645983)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tracking chains of \(\varSigma_2\)-elementarity |
scientific article |
Statements
Tracking chains of \(\varSigma_2\)-elementarity (English)
0 references
11 November 2011
0 references
The authors have been investigating ordinal numbers using the notion of elementarity. Let \({\mathcal R}_0\) be \(\langle\text{Ord}; \leq_0\rangle\), where \(\leq_0\) is the usual order on Ord. Given \(n\), define the expansion \({\mathcal R}_n:=\langle\text{Ord}; (\leq_i)_{i\leq n}\rangle\), where \(\leq_i\), \(i\leq n\), are simultaneously given by induction on \(\beta\), \(\alpha\leq_i\beta:\Leftrightarrow \langle\alpha;(\leq_i)_{i\leq n}\rangle\prec_{\Sigma_i}\langle\beta; (\leq_i)_{i\leq n}\rangle\), where \(\prec_{\Sigma_i}\) is the relation of \(\Sigma_i\)-elementary substructure. They already investigated \({\mathcal R}_1\) in a number of articles. The taget here is \({\mathcal R}_2\). The main achievement is arithmetical characterizations of \(\leq_1\) and \(\leq_2\). For that purpose, they invent a new tool, TC, the set of tracking chains. A tracking chain, tc, is a finite sequence of finite sequences (of various lengths) of ordinals less than \(1^\infty\) (the proof-theoretic ordinal of the set theory KP\(\ell_0\)), satisfying certain conditions. The formal definition is long and complicated. Shortening the authors' explanation: TC provides a grid on the segment of ordinals \(< 1^\infty\) with high resolution to characterize \(\leq_1\) and \(\leq_2\). Among (many) other results, the ordinal of a tc, the tc of an ordinal, and the relation \(\leq_{\text{TC}}\) on TC are defined, and the \(\leq_0\)-\(\leq_{\text{TC}}\) isomorphism is proved. Main results give, for an ordinal \(\alpha< 1^\infty\), its \(\leq_i\)-predecessor and an equivalent condition of its being \(\leq_i\)-minimal through \(\text{tc}(\alpha)\) for \(i= 1,2\). The subject being what it is, a huge battery of symbols, notions, lemmas, etc. is mobilized. The authors provide an index page, which helps. Also, they frequently give short useful explanations to definitions, lemmas, and so forth. This article presupposes acquaintance with the subject, particularly \textit{G. Wilken}'s two papers [ibid. 145, No. 2, 130--161 (2007; Zbl 1117.03063); ibid. 145, No. 2, 162--175 (2007; Zbl 1117.03064)].
0 references
ordinal notations
0 references
ordinal arithmetic
0 references
patterns of resemblance
0 references
elementary substructures
0 references
tracking chains
0 references