About the proof-theoretic ordinals of weak fixed point theories
DOI10.2307/2275451zbMATH Open0766.03033OpenAlexW2037020648MaRDI QIDQ4032884FDOQ4032884
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
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
second-order arithmeticcut-eliminationproof-theoretic ordinalsinduction axiomramified analysisarithmetic comprehension axiomfixed-point axioms
Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)
Cites Work
Cited In (20)
- An intensional fixed point theory over first order arithmetic
- A Note on (Meta)predicative Wellordering Proofs
- The \(\mu\) quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
- Title not available (Why is that?)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Non-elementary speed-ups in logic calculi
- Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
- Fixed point theories and dependent choice
- Provability algebras and proof-theoretic ordinals. I
- Proof-theoretic conservations of weak weak intuitionistic constructive set theories
- Proof Theory for Theories of Ordinals III: $$\Pi _{N}$$ -Reflection
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- Full and hat inductive definitions are equivalent in NBG
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- Fixed points in Peano arithmetic with ordinals
- 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
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)
