Pages that link to "Item:Q5544287"
From MaRDI portal
The following pages link to Systems of predicative analysis, II: Representations of ordinals (Q5544287):
Displaying 41 items.
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Termination of rewriting (Q1098624) (← links)
- A majorizing semantics for hyperarithmetic sentences (Q1147137) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- Proof theory of reflection (Q1332853) (← links)
- Derivatives of normal functions and \(\omega \)-models (Q1661685) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268) (← links)
- Ordinals. II: Some applications and a functorial approach (Q1817061) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Ackermann and Goodstein go functorial (Q2234350) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Some interesting connections between the slow growing hierarchy and the Ackermann function (Q2747706) (← links)
- Relative Truth Definability of Axiomatic Truth Theories (Q3163660) (← links)
- Well-Partial Orderings and their Maximal Order Types (Q3295157) (← links)
- Pointwise Transfinite Induction and a Miniaturized Predicativity (Q3305563) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- Natural well-orderings (Q3772212) (← links)
- Reflecting on incompleteness (Q3981446) (← links)
- Bounds for the closure ordinals of replete monotonic increasing functions (Q4088794) (← links)
- Built-up systems of fundamental sequences and hierarchies of number-theoretic functions (Q4133629) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- Applicable Mathematics in a Minimal Computational Theory of Sets (Q4553281) (← links)
- A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION (Q4628680) (← links)
- GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION (Q4959664) (← links)
- … and so on: Schütte on Naming Ordinals (Q5013893) (← links)
- Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees (Q5013906) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- Formalizing Scientifically Applicable Mathematics in a Definitional Framework (Q5195269) (← links)
- Feferman and the Truth (Q5214789) (← links)
- Proof Theory of Constructive Systems: Inductive Types and Univalence (Q5214792) (← links)
- Predicativity and Feferman (Q5214793) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
- , , AND REINHARDT’S PROGRAM (Q5880422) (← links)
- Well partial orders (Q6612816) (← links)
