English

Pure patterns of order 2

Logic 2017-10-06 v5

Abstract

We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order 22, showing that the latter characterize 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. As a corollary, we prove that Carlson's result on the well-quasi orderedness of respecting forests of order 22 implies transfinite induction up to the ordinal of KPl0\mathrm{KPl}_0. We expect that our approach will facilitate analysis of more powerful systems of patterns.

Keywords

Cite

@article{arxiv.1608.08421,
  title  = {Pure patterns of order 2},
  author = {Gunnar Wilken},
  journal= {arXiv preprint arXiv:1608.08421},
  year   = {2017}
}

Comments

corrected Theorem 4.2 with according changes in section 3 (mainly Definition 3.3), results unchanged. The manuscript was edited, aligned with reference [14] (moving former Lemma 3.5 there), and argumentation was revised, with minor corrections in (the proof of) Theorem 4.2; results unchanged. Updated revised preprint; to appear in the APAL (2017)

R2 v1 2026-06-22T15:34:55.636Z