Third-Order Computation and Bounded Arithmetic

DOI10.1093/LOGCOM/EXM040MaRDI QIDQ5441127zbMATH OpenOpenAlexFDO

Authors Alan Skelley

Publication date 7 February 2008

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/53fcfd36f7676acb4cd0a00b5015f2cea6c2f208

zbMATH Keywords

complexity classesbounded arithmeticthird-order theoryexponential-time hierarchy

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• Determinacy in third order arithmetic
• Computer Science Logic
• scientific article; zbMATH DE number 1344922
• Bounded arithmetic and the polynomial hierarchy
• scientific article; zbMATH DE number 1670480
• scientific article; zbMATH DE number 819737
• Higher-order computability
• Bounded arithmetic for NC, ALogTIME, L and NL
• The computational power of bounded arithmetic from the predicative viewpoint
• scientific article; zbMATH DE number 2047480

Cited in

(3)

• scientific article; zbMATH DE number 5885061 (Why is no real title available?)
• The limits of fixed-order computation
• Computer Science Logic

This page was built for publication: Third-Order Computation and Bounded Arithmetic

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