Abstract
For
As a supplement to this (refined Friedman style) independence result we further show that e.g., primitive recursive arithmetic,
Using results from Otter and from Matou{\v{s}}ek and Loebl we obtain similar characterizations for finite bad sequences of finite trees in terms of Otter's tree constant 2.9557652856... .
Citation
Andreas Weiermann. "An application of graphical enumeration to PA*." J. Symbolic Logic 68 (1) 5 - 16, March 2003. https://doi.org/10.2178/jsl/1045861503
Information