Tiering as a Recursion Technique
From MaRDI portal
Publication:3370611
DOI10.2178/bsl/1122038991zbMath1096.03049OpenAlexW1977893559MaRDI QIDQ3370611
Publication date: 8 February 2006
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1122038991
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (2)
Taming Modal Impredicativity: Superlazy Reduction ⋮ A quantitative model for simply typed λ-calculus
Cites Work
- The realm of primitive recursion
- Finitely stratified polymorphism
- A new recursion-theoretic characterization of the polytime functions
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Safe recursion with higher types and BCK-algebra
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
- Isometries of CSL Algebras
- A new “feasible” arithmetic
This page was built for publication: Tiering as a Recursion Technique
