Predicative Analysis of Feasibility and Diagonalization

DOI10.1007/978-3-540-73228-0_21MaRDI QIDQ3612638zbMATH OpenOpenAlexFDO

Authors Jean-Yves Marion

Publication date 10 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73228-0_21

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On tiered small jump operators
• A predicative approach to the classification problem
• scientific article; zbMATH DE number 806743
• scientific article; zbMATH DE number 1342252
• scientific article; zbMATH DE number 806752

Cited in

(3)

• Linear logic by levels and bounded time complexity
• Recursion Schemata for NC k
• On tiered small jump operators

This page was built for publication: Predicative Analysis of Feasibility and Diagonalization

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