\(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse mathematics and well-ordering principles: a pilot study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induktive Definitionen und Dilatoren. (Inductive definitions and dilators) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notation systems for infinitary derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary Treatment of Operator Controlled Derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A categorical construction of Bachmann–Howard fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable aspects of the Bachmann–Howard principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Π12-logic, Part 1: Dilators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to \(\Pi^1_2\)-logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematics and ordinal exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweistheorie vonKPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable Admissible Ordinals and Dilators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bar induction and \(\omega\) model reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Veblen functions for computability theorists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite investigations of transfinite derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Questions in Reverse Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. The first step into impredicativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Ordering Principles and Bar Induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-theoretic investigations on Kruskal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein System des Verknüpfenden Schliessens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank

Latest revision as of 12:30, 20 July 2024

scientific article
Language Label Description Also known as
English
\(\Pi_1^1\)-comprehension as a well-ordering principle
scientific article

    Statements

    \(\Pi_1^1\)-comprehension as a well-ordering principle (English)
    0 references
    0 references
    19 September 2019
    0 references
    Using \(\mathsf{ATR}^{\mathsf{set}}_0\) as a base system, the author proves that \(\Pi^1_1\)-comprehension is equivalent to the principle that every dilator has a Bachmann-Howard fixed point. This is a well-ordering principle of type 2, so the result proves conjectures of \textit{M. Rathjen} [Tributes 22, 179--212 (2014; Zbl 1358.03022)] and \textit{A. Montalbán} [Bull. Symb. Log. 17, No. 3, 431--454 (2011; Zbl 1233.03023)]. The equivalence result can be sharpened to hold over \(\mathsf{RCA}_0\), as shown in [the author, ``Computable aspects of the Bachmann-Howard Principle'', J. Math. Logic (to appear)]. The paper is based on parts of the author's PhD thesis [Type-two well-ordering principles, admissible sets, and \(\Pi^1_1\)-comprehension. Leeds: University of Leeds (PhD Thesis) (2018)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    well-ordering principles
    0 references
    \(\Pi_1^1\)-comprehension
    0 references
    admissible sets
    0 references
    dilators
    0 references
    ordinal analysis
    0 references
    reverse mathematics
    0 references
    ATR
    0 references
    \(\Pi_1^1\)-CA
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references