PREDICATIVITY THROUGH TRANSFINITE REFLECTION

From MaRDI portal
Revision as of 00:18, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5359565

DOI10.1017/JSL.2017.30zbMATH Open1402.03086arXiv1412.5521OpenAlexW2964107161WikidataQ120373613 ScholiaQ120373613MaRDI QIDQ5359565

Author name not available (Why is that?)

Publication date: 26 September 2017

Published in: (Search for Journal in Brave)

Abstract: Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of stronger reflection principles.


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



No records found.


No records found.








This page was built for publication: PREDICATIVITY THROUGH TRANSFINITE REFLECTION

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