Pages that link to "Item:Q5343335"
From MaRDI portal
The following pages link to Functionals defined by transfinite recursion (Q5343335):
Displaying 16 items.
- Exact bounds on epsilon processes (Q535160) (← links)
- Foundations for analysis and proof theory (Q798634) (← links)
- Constructing recursion operators in intuitionistic type theory (Q1094421) (← links)
- Gentzen reduction revisited (Q1140640) (← links)
- Transfinite expansions of arithmetic formulas (Q1254249) (← links)
- Closing the gap between the continuous functionals and recursion in \(^3E\) (Q1387093) (← links)
- Epsilon substitution method for elementary analysis (Q1908821) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- Exact estimates of the provability of transfinite induction in the initial segments of arithmetic (Q2557248) (← links)
- Update procedures and the 1-consistency of arithmetic (Q2776806) (← links)
- Pa-Beweisbare ∀∃-Formeln (Q3338236) (← links)
- Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation (Q3370623) (← links)
- Axiomatic recursion theory and the continuous functionals (Q3717039) (← links)
- König's lemma, the ω-Rule and primitive recursive arithmetic (Q3724327) (← links)
- Classe of functions defined by transducers (Q4007408) (← links)
- Consistency proof without transfinite induction for a formal system for turing machines (Q4192056) (← links)