scientific article; zbMATH DE number 176204

zbMATH Open0769.03032MaRDI QIDQ4035308FDOQ4035308

Authors: Fernando Ferreira 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

bounded arithmeticprovably total functionspolynomial time hierarchy

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cited In (6)

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

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)