Well-Ordering Principles in Proof Theory and Reverse Mathematics

DOI10.1007/978-3-030-77799-9_4OpenAlexW3094559094MaRDI QIDQ5055281

Michael Rathjen

Publication date: 13 December 2022

Published in: Axiomatic Thinking II (Search for Journal in Brave)

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

zbMATH Keywords

cut eliminationreverse mathematicsordinal analysisordinal representation systemsdilators\(\omega\)-modelsinfinite proof theory\(\beta\)-models

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) History of mathematical logic and foundations (03-03)

Related Items

Hilbert’s Axiomatisches Denken ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The foundations of mathematics. A study in the philosophy of science
• Proof-theoretic analysis of KPM
• Proof theory. The first step into impredicativity
• Reverse mathematics and well-ordering principles: a pilot study
• Set recursion and \(\Pi ^ 1_ 2\)-logic
• Induktive Definitionen und Dilatoren. (Inductive definitions and dilators)
• Proof-theoretic investigations on Kruskal's theorem
• Fixed points in Peano arithmetic with ordinals
• Reverse mathematics and ordinal exponentiation
• Proof theory of reflection
• Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
• Proof theory. An introduction
• Proof theory for theories of ordinals. II: \(\Pi_{3}\)-reflection
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Intuitionism and proof theory. Proceedings of the summer conference at Buffalo N. Y. 1968
• Introduction to \(\Pi^1_2\)-logic
• Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• The Veblen functions for computability theorists
• Open Questions in Reverse Mathematics
• Ein System des Verknüpfenden Schliessens
• Beweistheorie vonKPN
• Π12-logic, Part 1: Dilators
• Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
• Der erste Widerspruchsfreiheitsbeweis für die klassische Zahlentheorie
• The Recursively Mahlo Property in Second Order Arithmetic
• Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
• Computable aspects of the Bachmann–Howard principle
• A categorical construction of Bachmann–Howard fixed points
• Systems of predicative analysis
• Well-Ordering Principles and Bar Induction
• Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
• Systems of predicative analysis, II: Representations of ordinals
• The strength of Martin-Löf type theory with a superuniverse. II
• Proof theory