Iterated inductive definitions revisited
From MaRDI portal
Recommendations
Cites work
- A system of abstract constructive ordinals
- A Uniform Approach to Fundamental Sequences and Hierarchies
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- An ordinal analysis of stability
- Another reduction of classical ID_ to constructive ID^i_
- Applications of cut-free infinitary derivations to generalized recursion theory
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Elementary induction on abstract structures
- From subsystems of analysis to subsystems of set theory
- Functional interpretation and inductive definitions
- Hilbert’s Programme and Ordinal Analysis
- scientific article; zbMATH DE number 3833954 (Why is no real title available?)
- scientific article; zbMATH DE number 432702 (Why is no real title available?)
- scientific article; zbMATH DE number 4039890 (Why is no real title available?)
- scientific article; zbMATH DE number 3545638 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 1102104 (Why is no real title available?)
- scientific article; zbMATH DE number 1882496 (Why is no real title available?)
- scientific article; zbMATH DE number 922625 (Why is no real title available?)
- scientific article; zbMATH DE number 3231083 (Why is no real title available?)
- scientific article; zbMATH DE number 3346319 (Why is no real title available?)
- scientific article; zbMATH DE number 3365218 (Why is no real title available?)
- scientific article; zbMATH DE number 3383999 (Why is no real title available?)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Ordinals connected with formal theories for transfinitely iterated inductive definitions
- Proof theory of reflection
- Proof theory. The first step into impredicativity
- Provable wellorderings of formal theories for transfinitely iterated inductive definitions
- Provably recursive functions of reflection
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Ways of proof theory. Collected papers by speakers of the colloquium and workshop held on the occasion of the retirement of Wolfram Pohlers, July 17--19, 2008, Münster, Germany
Cited in
(6)- A note on iterated consistency and infinite proofs
- Iterated dominance revisited
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
- On the Performance of Axiom Systems
- Variations on inductive-recursive definitions
- Comparing inductive and circular definitions: Parameters, complexity and games
This page was built for publication: Iterated inductive definitions revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214787)