Functionals defined by transfinite recursion
From MaRDI portal
Publication:5343335
DOI10.2307/2270132zbMath0133.25202OpenAlexW2072163715MaRDI QIDQ5343335
Publication date: 1965
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270132
Related Items (max. 100)
Constructing recursion operators in intuitionistic type theory ⋮ König's lemma, the ω-Rule and primitive recursive arithmetic ⋮ Epsilon substitution method for elementary analysis ⋮ Gentzen reduction revisited ⋮ Unnamed Item ⋮ Exact bounds on epsilon processes ⋮ Pa-Beweisbare ∀∃-Formeln ⋮ Ackermann's substitution method (remixed) ⋮ Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation ⋮ Transfinite expansions of arithmetic formulas ⋮ Consistency proof without transfinite induction for a formal system for turing machines ⋮ Exact estimates of the provability of transfinite induction in the initial segments of arithmetic ⋮ Foundations for analysis and proof theory
Cites Work
This page was built for publication: Functionals defined by transfinite recursion
