Tiering as a Recursion Technique

DOI10.2178/BSL/1122038991MaRDI QIDQ3370611zbMATH OpenOpenAlexFDO

Authors Harold Simmons

Publication date 8 February 2006

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/bsl/1122038991

zbMATH Keywords

surveytiering

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03)

Recommendations

• Tailoring recursion for complexity
• Tailoring recursion for complexity
• Recursion-theoretic hierarchies
• scientific article; zbMATH DE number 3963179
• A classification of an iterative hierarchy
• scientific article; zbMATH DE number 3978405
• scientific article; zbMATH DE number 465472
• Recursion Schemes for Dynamic Programming
• Split-level iteration

Cites work

• A new “feasible” arithmetic
• A new recursion-theoretic characterization of the polytime functions
• Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
• Finitely stratified polymorphism
• Isometries of CSL Algebras
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• Safe recursion with higher types and BCK-algebra
• The realm of primitive recursion

Cited in

(2)

• Taming Modal Impredicativity: Superlazy Reduction
• A quantitative model for simply typed λ-calculus

This page was built for publication: Tiering as a Recursion Technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370611)