by
Lev Beklemishev

Citations: | 1 - 0 self |

@MISC{Beklemishev95iteratedlocal,

author = {Lev Beklemishev},

title = {Iterated Local Reflection vs Iterated Consistency},

year = {1995}

}

For "natural enough" systems of ordinal notation we show that times iterated local reflection schema over a sufficiently strong arithmetic T 0 proves the same 1-sentences as! times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at-numbers. We also derive the following more general "mixed" formulas estimating the consistency strength of iterated local reflection: for all ordinals 1 and all,

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2013 The Pennsylvania State University