A note on fragments of uniform reflection in second order arithmetic

DOI10.1017/BSL.2022.23MaRDI QIDQ5044314zbMATH OpenOpenAlexFDO

Authors Emanuele Frittaion

Publication date 25 October 2022

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

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

zbMATH Keywords

second order arithmeticpredicative cut elimination\( \omega \)-arithmeticuniform reflection

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Foundations of classical theories (including reverse mathematics) (03B30) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Reflection Principles in Fragments of Peano Arithmetic
• A uniform characterization of \(\Sigma_1\)-reflection over the fragments of Peano arithmetic
• Reflection principles and provability algebras in formal arithmetic
• Proof theoretic analysis by iterated reflection
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION

Cites work

• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 1390277 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• Arithmetization of metamathematics in a general setting
• Elementary descent recursion and proof theory
• Finite investigations of transfinite derivations
• Induction rules, reflection principles, and provably recursive functions
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Notation systems for infinitary derivations
• On parameter free induction schemas
• Ordinal Analysis with an Introduction to Proof Theory
• Parameter free induction and provably total computable functions
• Reducing ω-model reflection to iterated syntactic reflection
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Reflection Principles in Fragments of Peano Arithmetic
• Reflection ranks and ordinal analysis
• Subsystems of second order arithmetic
• The optimality of induction as an axiomatization of arithmetic
• Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis
• Transfinite recursive progressions of axiomatic theories

Cited in

(7)

• Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
• Set-theoretic reflection is equivalent to induction over well-founded classes
• Parameterfree comprehension does not imply full comprehension in second order Peano arithmetic
• Reflection Principles in Fragments of Peano Arithmetic
• A reflection on collection
• A uniform characterization of \(\Sigma_1\)-reflection over the fragments of Peano arithmetic
• A note on fragments of uniform reflection in second order arithmetic

This page was built for publication: A note on fragments of uniform reflection in second order arithmetic

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