Systems of predicative analysis, II: Representations of ordinals

DOI10.2307/2269866zbMath0162.02201OpenAlexW2066527932MaRDI QIDQ5544287

Solomon Feferman

Publication date: 1968

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

Full work available at URL: https://doi.org/10.2307/2269866

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (40)

, , AND REINHARDT’S PROGRAM ⋮ Proof theory of reflection ⋮ Relative Truth Definability of Axiomatic Truth Theories ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Reflecting on incompleteness ⋮ Termination of rewriting ⋮ Derivatives of normal functions and \(\omega \)-models ⋮ Hyperations, Veblen progressions and transfinite iteration of ordinal functions ⋮ Natural well-orderings ⋮ A majorizing semantics for hyperarithmetic sentences ⋮ PREDICATIVITY THROUGH TRANSFINITE REFLECTION ⋮ Predicatively unprovable termination of the Ackermannian Goodstein process ⋮ A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ Bounds for the closure ordinals of replete monotonic increasing functions ⋮ Ackermann and Goodstein go functorial ⋮ Pointwise Transfinite Induction and a Miniaturized Predicativity ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Fast growing functions based on Ramsey theorems ⋮ Applicable Mathematics in a Minimal Computational Theory of Sets ⋮ Some interesting connections between the slow growing hierarchy and the Ackermann function ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets ⋮ An ordinal analysis of stability ⋮ Built-up systems of fundamental sequences and hierarchies of number-theoretic functions ⋮ An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension ⋮ GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION ⋮ Feferman and the Truth ⋮ Proof Theory of Constructive Systems: Inductive Types and Univalence ⋮ Predicativity and Feferman ⋮ Theory of proofs (arithmetic and analysis) ⋮ Automating the Knuth Bendix ordering ⋮ Ordinals. II: Some applications and a functorial approach ⋮ Formalizing Scientifically Applicable Mathematics in a Definitional Framework ⋮ … and so on: Schütte on Naming Ordinals ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Countable algebra and set existence axioms ⋮ Ordinal notations and well-orderings in bounded arithmetic ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property

Cites Work

• Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen

This page was built for publication: Systems of predicative analysis, II: Representations of ordinals