About the proof-theoretic ordinals of weak fixed point theories

DOI10.2307/2275451MaRDI QIDQ4032884zbMATH OpenOpenAlexFDO

Authors Gerhard Jäger, Barbara Primo

Publication date 1 April 1993

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

Full work available at URL https://boris.unibe.ch/115096/1/S0022481200022556.pdf

zbMATH Keywords

second-order arithmeticcut-eliminationproof-theoretic ordinalsinduction axiomramified analysisarithmetic comprehension axiomfixed-point axioms

Mathematics Subject Classification ID

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

Recommendations

• The proof-theoretic analysis of transfinitely iterated fixed point theories
• An intensional fixed point theory over first order arithmetic
• Fixed point theories and dependent choice
• The proof-theoretic analysis of transfinitely iterated quasi least fixed points
• The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies

Cited in

(20)

• A Note on (Meta)predicative Wellordering Proofs
• Proof-theoretic conservations of weak weak intuitionistic constructive set theories
• Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
• Full and hat inductive definitions are equivalent in NBG
• The \(\mu\) quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
• Proof Theory for Theories of Ordinals III: $$\Pi _{N}$$ -Reflection
• Fixed point theories and dependent choice
• An intensional fixed point theory over first order arithmetic
• Non-elementary speed-ups in logic calculi
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• scientific article; zbMATH DE number 2186953 (Why is no real title available?)
• Some results on cut-elimination, provable well-orderings, induction and reflection
• Takeuti's well-ordering proof: finitistically fine?
• Second order theories with ordinals and elementary comprehension
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Provability algebras and proof-theoretic ordinals. I
• The proof-theoretic analysis of transfinitely iterated quasi least fixed points
• Fixed points in Peano arithmetic with ordinals
• The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
• Proof theory for theories of ordinals. I: Recursively Mahlo ordinals

This page was built for publication: About the proof-theoretic ordinals of weak fixed point theories

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