On inverse Goodstein sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3120162 (Why is no real title available?)
- scientific article; zbMATH DE number 4031678 (Why is no real title available?)
- scientific article; zbMATH DE number 4031679 (Why is no real title available?)
- scientific article; zbMATH DE number 4079410 (Why is no real title available?)
- scientific article; zbMATH DE number 956479 (Why is no real title available?)
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal
- A categorical construction of Bachmann–Howard fixed points
- A new system of proof-theoretic ordinal functions
- Accessible Independence Results for Peano Arithmetic
- An order-theoretic characterization of the Howard-Bachmann-hierarchy
- Bachmann-Howard derivatives
- Computable aspects of the Bachmann-Howard principle
- Functorial Fast-Growing Hierarchies
- Goodstein's theorem revisited
- Investigations of subsystems of second order arithmetic and set theory in strength between \(\Pi^1_1\)-CA and \(\Delta^1_2\)-\(\text{CA}+\text{BI}\). I
- Minimal bad sequences are necessary for a uniform Kruskal theorem
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- On the restricted ordinal theorem
- Patterns of resemblance and Bachmann-Howard fixed points
- Predicative collapsing principles
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Proof-theoretic investigations on Kruskal's theorem
- Reverse mathematics and ordinal exponentiation
- Reverse mathematics and well-ordering principles
- Some uses of dilators in combinatorial problems. II
- Subsystems of second order arithmetic
- Systems of predicative analysis
- The Galvin-Prikry theorem and set existence axioms
- The Veblen functions for computability theorists
- Weak and strong versions of effective transfinite recursion
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- Weak comparability of well orderings and reverse mathematics
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Π12-logic, Part 1: Dilators
This page was built for publication: On inverse Goodstein sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6935620)