Proof theoretic analysis by iterated reflection

DOI10.1007/978-3-319-22156-4_9MaRDI QIDQ4637223zbMATH OpenOpenAlexFDO

Authors Lev D. Beklemishev

Publication date 18 April 2018

Published in Turing’s Revolution (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-22156-4_9

zbMATH Keywords

ordinal analysisparameter-free inductionpartial conservativityreflection principlesTuring progressions

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30)

Recommendations

• Proof-theoretic analysis by iterated reflection
• scientific article; zbMATH DE number 1048040
• Iterated local reflection versus iterated consistency
• ON THE ITERATED ω‐RULE
• Reflection principles and provability algebras in formal arithmetic

Cites work

• A proof-theoretic analysis of collection
• Arithmetization of metamathematics in a general setting
• Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
• Existence and feasibility in arithmetic
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 4083572 (Why is no real title available?)
• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• scientific article; zbMATH DE number 3784875 (Why is no real title available?)
• scientific article; zbMATH DE number 1215496 (Why is no real title available?)
• scientific article; zbMATH DE number 218514 (Why is no real title available?)
• scientific article; zbMATH DE number 937377 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3217001 (Why is no real title available?)
• scientific article; zbMATH DE number 3225350 (Why is no real title available?)
• scientific article; zbMATH DE number 3320380 (Why is no real title available?)
• scientific article; zbMATH DE number 3330710 (Why is no real title available?)
• Induction rules, reflection principles, and provably recursive functions
• Interpretability of various extensions of arithmetic
• On n-quantifier induction
• On parameter free induction schemas
• On the scheme of induction for bounded arithmetic formulas
• Parameter free induction and provably total computable functions
• Proof theory. The first step into impredicativity
• Proof-theoretic analysis by iterated reflection
• Provability algebras and proof-theoretic ordinals. I
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Reflection Principles in Fragments of Peano Arithmetic
• Systems of predicative analysis
• The optimality of induction as an axiomatization of arithmetic
• Transfinite induction within Peano arithmetic
• Transfinite recursive progressions of axiomatic theories
• Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt

Cited in

(21)

• Fixed points in Peano arithmetic with ordinals
• A proof-theoretic analysis of collection
• Proof-theoretic analysis by iterated reflection
• A note on iterated consistency and infinite proofs
• Iterated local reflection versus iterated consistency
• Reflection algebras and conservation results for theories of iterated truth
• Local reflection, definable elements and 1-provability
• Slow reflection
• Reflection principles and provability algebras in formal arithmetic
• ON THE ITERATED ω‐RULE
• scientific article; zbMATH DE number 1048040 (Why is no real title available?)
• scientific article; zbMATH DE number 1951638 (Why is no real title available?)
• Iterated reflection over full disquotational truth
• A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
• Reflection ranks and ordinal analysis
• A note on fragments of uniform reflection in second order arithmetic
• Reflection calculus and conservativity spectra
• A proof theoretic analysis of intruder theories
• A Proof Theoretic Analysis of Intruder Theories
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• Feferman's completeness theorem

This page was built for publication: Proof theoretic analysis by iterated reflection

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