Second order theories with ordinals and elementary comprehension (Q1908814): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEVELS OF IMPLICATION AND TYPE FREE THEORIES OF CLASSIFICATIONS WITH APPROXIMATION OPERATOR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. II / 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: Fixed points in Peano arithmetic with ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the proof-theoretic ordinals of weak fixed point theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of parameters in bar rule and bar induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank

Revision as of 10:02, 24 May 2024

scientific article
Language Label Description Also known as
English
Second order theories with ordinals and elementary comprehension
scientific article

    Statements

    Second order theories with ordinals and elementary comprehension (English)
    0 references
    0 references
    0 references
    22 September 1996
    0 references
    We study elementary second-order extensions of the theory \(\text{ID}_1\) of noniterated inductive definitions and the theory \(\text{PA}_\Omega\) of Peano arithmetic with ordinals. We determine the exact proof-theoretic strength of those extensions and their natural subsystems, and we relate them to subsystems of analysis with arithmetic comprehension plus \(\Pi^1_1\) comprehension and bar induction without set parameters.
    0 references
    second-order arithmetic
    0 references
    elementary second-order extensions
    0 references
    inductive definitions
    0 references
    Peano arithmetic with ordinals
    0 references
    proof-theoretic strength
    0 references
    subsystems of analysis
    0 references
    arithmetic comprehension
    0 references
    bar induction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references