Recent Advances in Ordinal Analysis: Π12— CA and Related Systems

DOI10.2307/421132zbMath0855.03035OpenAlexW2124711040MaRDI QIDQ4873894

Michael Rathjen

Publication date: 9 February 1997

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0104-toc.htm

zbMATH Keywords

proof theoryordinal notationsordinal analysisadmissible setssubsystems of analysisKPioperator controlled derivations\(\Pi^ 1_ 1\)-comprehensioniterated \(\Pi^ 1_ 2\)-comprehension

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Related Items (16)

LARGE CARDINALS AS PRINCIPLES OF STRUCTURAL REFLECTION ⋮ REVERSE MATHEMATICS OF MF SPACES ⋮ Combinatory logic with polymorphic types ⋮ Epsilon substitution for \(ID_1\) via cut-elimination ⋮ Strong unfoldability, shrewdness and combinatorial consequences ⋮ Relativized ordinal analysis: the case of power Kripke-Platek set theory ⋮ An ordinal analysis of stability ⋮ Elementary patterns of resemblance ⋮ An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension ⋮ Does Mathematics Need New Axioms? ⋮ Does Mathematics Need New Axioms? ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Ordinal analysis by transformations ⋮ A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ Huge reflection

Cites Work

• Unnamed Item
• Unnamed Item
• Proof-theoretic analysis of KPM
• Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
• Proof theory of reflection
• The strength of some Martin-Löf type theories
• Proof theory and ordinal analysis
• Consistency proofs of subsystems of classical analysis
• Introduction to \(\Pi^1_2\)-logic
• Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
• Projective determinacy
• Beweistheorie vonKPN
• On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logic
• Strong axioms of infinity and elementary embeddings
• A well-ordering proof for Feferman's theoryT 0
• Systems of predicative analysis
• The fine structure of the constructible hierarchy

This page was built for publication: Recent Advances in Ordinal Analysis: Π¹₂— CA and Related Systems