Well ordering principles for iterated ^1_1-comprehension

DOI10.1007/S00029-023-00879-2MaRDI QIDQ6080077zbMATH OpenFDO

Authors Anton Freund, Michael Rathjen

Publication date 30 October 2023

Published in Selecta Mathematica. New Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

ordinal analysisreverse mathematicsadmissible setstransfinite recursiondilatorswell ordering principlesiterated \(\Pi^1_1\)-comprehensionordinal collapsing functions

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Ordinal and cardinal numbers (03E10) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Abstract: We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $P{i}_1^1$-comprehension and the existence of admissible sets, over weak base theories. Our work extends a previous result on the non-iterated case, which had been conjectured in Montalb'an's "Open questions in reverse mathematics" (Bull. Symb. Log. 17(3)2011). This previous result has already been applied to the reverse mathematics of combinatorial and set theoretic principles. The present paper is a significant contribution to a general approach that connects these fields.

Recommendations

• A categorical construction of Bachmann–Howard fixed points
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Well-Ordering Principles in Proof Theory and Reverse Mathematics
• How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
• scientific article; zbMATH DE number 6536275
• Partial impredicativity in reverse mathematics
• The strength of admissibility without foundation
• An ordinal analysis of stability
• Plus‐1 Results for E‐Recursion
• Bachmann-Howard derivatives

Cites work

• scientific article; zbMATH DE number 6536275 (Why is no real title available?)
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 4039890 (Why is no real title available?)
• scientific article; zbMATH DE number 4079410 (Why is no real title available?)
• scientific article; zbMATH DE number 956479 (Why is no real title available?)
• scientific article; zbMATH DE number 3792154 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3532926 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1215496 (Why is no real title available?)
• scientific article; zbMATH DE number 3342822 (Why is no real title available?)
• scientific article; zbMATH DE number 3346319 (Why is no real title available?)
• scientific article; zbMATH DE number 3349789 (Why is no real title available?)
• scientific article; zbMATH DE number 3198033 (Why is no real title available?)
• A categorical construction of Bachmann–Howard fixed points
• A new system of proof-theoretic ordinal functions
• Bachmann-Howard derivatives
• Bar induction and model reflection
• Beweistheorie vonKPN
• Computable aspects of the Bachmann-Howard principle
• Cut elimination for impredicative infinitary systems. Part II ordinal analysis for iterated inductive definitions
• Derivatives of normal functions in reverse mathematics
• Ein System des Verknüpfenden Schliessens
• Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
• From Kruskal’s theorem to Friedman’s gap condition
• Gentzen's Centenary
• Introduction to \(\Pi^1_2\)-logic
• Investigations of subsystems of second order arithmetic and set theory in strength between \(\Pi^1_1\)-CA and \(\Delta^1_2\)-\(\text{CA}+\text{BI}\). I
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Minimal bad sequences are necessary for a uniform Kruskal theorem
• Open questions in reverse mathematics
• Patterns of resemblance and Bachmann-Howard fixed points
• Predicative collapsing principles
• Proof theory. The first step into impredicativity
• Proof-theoretic investigations on Kruskal's theorem
• Reverse mathematics and ordinal exponentiation
• Reverse mathematics and well-ordering principles
• Reverse mathematics and well-ordering principles: a pilot study
• Set-theoretic reflection is equivalent to induction over well-founded classes
• Subsystems of second order arithmetic
• The Galvin-Prikry theorem and set existence axioms
• The Veblen functions for computability theorists
• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Well-Ordering Principles in Proof Theory and Reverse Mathematics
• Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Π12-logic, Part 1: Dilators

Cited in

(4)

• WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
• \(\Sigma_1\)-wellorders without collapsing
• Intuitionistically provable recursive well-orderings
• \(\Pi_1^1\)-comprehension as a well-ordering principle

This page was built for publication: Well ordering principles for iterated \(\Pi^1_1\)-comprehension

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