Feasible functions over co-inductive data

DOI10.1007/978-3-642-13824-9_16MaRDI QIDQ4931600zbMATH OpenOpenAlexFDO

Authors Ramyaa Ramyaa, Daniel M. Leivant

Publication date 29 September 2010

Published in Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13824-9_16

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Some applications of logic to feasibility in higher types
• Implicit computational complexity for higher type functionals (extended abstract)
• Provably total functions of intuitionistic bounded arithmetic
• A proof-theoretic characterization of the basic feasible functionals
• scientific article; zbMATH DE number 2110622

Cited in

(4)

• Characterizing polynomial time complexity of stream programs using interpretations
• The functions provable by first order abstraction
• Implicit computational complexity for higher type functionals (extended abstract)
• Ramified Corecurrence and Logspace

This page was built for publication: Feasible functions over co-inductive data

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