Functionals defined by transfinite recursion
From MaRDI portal
Publication:5343335
DOI10.2307/2270132zbMATH Open0133.25202OpenAlexW2072163715MaRDI QIDQ5343335FDOQ5343335
Authors: W. W. Tait 
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
Cites Work
Cited In (16)
- Consistency proof without transfinite induction for a formal system for turing machines
- Exact bounds on epsilon processes
- Transfinite expansions of arithmetic formulas
- Closing the gap between the continuous functionals and recursion in \(^3E\)
- Classe of functions defined by transducers
- Gentzen reduction revisited
- Epsilon substitution method for elementary analysis
- König's lemma, the ω-Rule and primitive recursive arithmetic
- Pa-Beweisbare ∀∃-Formeln
- Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
- Ackermann's substitution method (remixed)
- Exact estimates of the provability of transfinite induction in the initial segments of arithmetic
- Axiomatic recursion theory and the continuous functionals
- Foundations for analysis and proof theory
- Constructing recursion operators in intuitionistic type theory
- Update procedures and the 1-consistency of arithmetic
This page was built for publication: Functionals defined by transfinite recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343335)
