PREDICATIVITY THROUGH TRANSFINITE REFLECTION

DOI10.1017/JSL.2017.30MaRDI QIDQ5359565zbMATH OpenOpenAlexWikidataFDO

Authors Andrés Cordón-Franco, David Fernández-Duque, Joost J. Joosten, F. Félix Lara Martin

Publication date 26 September 2017

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.5521, https://idus.us.es/xmlui/handle//11441/87646

zbMATH Keywords

provability logicreflection principlessecond-order arithmetic

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Second- and higher-order arithmetic and fragments (03F35) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

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.

Recommendations

• Predicativity and Feferman
• Predicativity and constructive mathematics
• scientific article; zbMATH DE number 3316033
• The Limits of Predicativity Revisited
• Pointwise transfinite induction and a miniaturized predicativity
• scientific article; zbMATH DE number 2152234
• Transfinite meta-inferences
• Transfinite sequences of constructive predicate logics
• Predicativity and regions-based continua
• Transfinite update procedures for predicative systems of analysis

Cites work

• \(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic
• Church's thesis, continuity, and set theory
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Fragments of Arithmetic and true sentences
• Harvey Friedman's research on the foundations of mathematics
• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• scientific article; zbMATH DE number 1170091 (Why is no real title available?)
• scientific article; zbMATH DE number 4195937 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 5046774 (Why is no real title available?)
• scientific article; zbMATH DE number 2236636 (Why is no real title available?)
• Induction rules, reflection principles, and provably recursive functions
• Models of transfinite provability logic
• On provability logics with linearly ordered modalities
• On some slowly terminating term rewriting systems
• On strong provability predicates and the associated modal logics
• On the reduction property for GLP-algebras
• Provability algebras and proof-theoretic ordinals. I
• Reflection principles and provability algebras in formal arithmetic
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Subsystems of second order arithmetic
• Systems of predicative analysis
• Systems of predicative analysis, II: Representations of ordinals
• The optimality of induction as an axiomatization of arithmetic
• The polytopologies of transfinite provability logic
• The worm principle
• Well-orders in the transfinite Japaridze algebra

Cited in

(11)

• The omega-rule interpretation of transfinite provability logic
• Hyperarithmetical worm battles
• Relative predicativity and dependent recursion in second-order set theory and higher-order theories
• ON THE ITERATED ω‐RULE
• Transfinite dependent choice and ω-model reflection
• scientific article; zbMATH DE number 1422719 (Why is no real title available?)
• MÜNCHHAUSEN PROVABILITY
• A note on fragments of uniform reflection in second order arithmetic
• Predicative collapsing principles
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• A topological completeness theorem for transfinite provability logic

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)