scientific article; zbMATH DE number 176204

MaRDI QIDQ4035308zbMATH OpenFDO

Authors Fernando Ferreira

Publication date 18 May 1993

zbMATH Keywords

bounded arithmeticpolynomial time hierarchyprovably total functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• Delineating classes of computational complexity via second order theories with weak set existence principles. I
• scientific article; zbMATH DE number 4059391
• scientific article; zbMATH DE number 999649
• Restricted polynomial induction versus ordinary induction
• Bounded arithmetic and truth definition

Cited in

(7)

• Binary models generated by their tally part
• Theories with self-application and computational complexity.
• Separating NC along the \(\delta\) axis
• Introduction to clarithmetic. II
• Admissible closures of polynomial time computable arithmetic
• Enumerating error bounded polytime algorithms through arithmetical theories
• Schubert induction

This page was built for publication:

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