Slow reflection

DOI10.1016/J.APAL.2017.06.003MaRDI QIDQ2407272zbMATH OpenOpenAlexDBLPWikidataFDO

Publication date 29 September 2017

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.08214

Peano arithmetic fast growing hierarchy slow consistency consistency strength iterated consistency slow reflection

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Models of arithmetic and set theory (03C62) Relative consistency and interpretations (03F25)

Abstract: We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic (

m a t h b f P A

). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower complexity) and introduce a new provably total function. At the same time the consistency of

m a t h b f P A

plus slow reflection is provable in

m a t h b f P A + o p e r a t o r n a m e C o n (m a t h b f P A)

. We deduce a conjecture of S.-D. Friedman, Rathjen and Weiermann: Transfinite iterations of slow consistency generate a hierarchy of precisely

v a r e p s i l o n_{0}

stages between

m a t h b f P A

and

m a t h b f P A + o p e r a t o r n a m e C o n (m a t h b f P A)

(where

o p e r a t o r n a m e C o n (m a t h b f P A)

refers to the usual consistency statement).

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Slow reflection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407272)