Well ordering principles for iterated ^1_1-comprehension

DOI10.1007/S00029-023-00879-2arXiv2112.08005MaRDI QIDQ6080077FDOQ6080077

Authors: Anton Freund, Michael Rathjen 

Publication date: 30 October 2023

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

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.

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

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

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)

Cites Work

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

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)