Abstract

By combining tree representation of sets with the method introduced in the previous three papers I–III [39,35,37] in the series, we give a new Π21-preserving interpretation of KPωr+(Πn+2-Found)+θ (Kripke–Platek set theory with the foundation schema restricted to Πn+2, and augmented by θ) in Σ11-AC0+(Πn+21-TI)+θ for any Π21 sentence θ, where the language of second order arithmetic is considered as a sublanguage of that of set theory via the standard interpretation. Thus the addition of any Π21 theorem of BI≡Σ11-AC0+(Π∞1-TI) does not increase the consistency strength of KPω. Among such Π21 theorems are several fixed point principles for positive arithmetical operators and ω-model reflection (the cofinal existence of coded ω-models) for theorems of BI. The reader's familiarity to the previous works I–III in the series might help, but is not necessary.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call