Pure patterns of order 2
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 , showing that the latter characterize the proof-theoretic ordinal of the fragment - of second order number theory, or equivalently the set theory . As a corollary, we prove that Carlson's result on the well-quasi orderedness of respecting forests of order implies transfinite induction up to the ordinal of . 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)