New Computational Paradigms

DOI10.1007/B136981MaRDI QIDQ5717064zbMATH OpenOpenAlexFDO

Authors Geoffrey E. Ostrin, Stanley S. Wainer

Publication date 11 January 2006

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

Full work available at URL https://doi.org/10.1007/b136981

zbMATH Keywords

ordinal analysisprovable recursionslow growing hierarchy

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• The computational power of bounded arithmetic from the predicative viewpoint
• Inductive definitions over a predicative arithmetic
• Delineating classes of computational complexity via second order theories with weak set existence principles. I
• scientific article; zbMATH DE number 2110622
• Proof theoretic complexity of low subrecursive classes

Cited in

(11)

• Elementary arithmetic
• On the untenability of Nelson's predicativism
• Inductive definitions over a predicative arithmetic
• Proof theoretic complexity of low subrecursive classes
• scientific article; zbMATH DE number 3875271 (Why is no real title available?)
• Undecidable complexity statements in -arithmetic
• scientific article; zbMATH DE number 1253963 (Why is no real title available?)
• On the complexity of computation of rudimentary predicates
• scientific article; zbMATH DE number 2110622 (Why is no real title available?)
• scientific article; zbMATH DE number 7155168 (Why is no real title available?)
• The computational power of bounded arithmetic from the predicative viewpoint

This page was built for publication: New Computational Paradigms

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