scientific article; zbMATH DE number 4160708

MaRDI QIDQ3487327zbMATH OpenFDO

Authors Fernando Ferreira

Publication date 1990

zbMATH Keywords

inductionprovably recursive functionscomputable arithmeticbounded analog of primitive recursive arithmeticNP-induction on notationpolynomial time decidable predicates

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 4059391
• Admissible closures of polynomial time computable arithmetic
• Notes on polynomially bounded arithmetic
• scientific article; zbMATH DE number 4006252
• Polynomial time operations in explicit mathematics

Cited in

(24)

• Bounded theories for polyspace computability
• scientific article; zbMATH DE number 4006252 (Why is no real title available?)
• A simple proof of Parsons' theorem
• The counting hierarchy in binary notation
• scientific article; zbMATH DE number 4128804 (Why is no real title available?)
• Nondeterministic polynomial-time computations and models of arithmetic
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• An algebraic treatment of quantifier-free systems of arithmetic
• A recursion-theoretic characterisation of the positive polynomial-time functions
• Binary models generated by their tally part
• Admissible closures of polynomial time computable arithmetic
• The provably terminating operations of the subsystem PETJ of explicit mathematics
• scientific article; zbMATH DE number 3932433 (Why is no real title available?)
• Herbrand analyses
• The axiom of choice and combinatory logic
• Theories with self-application and computational complexity.
• Computing in Finite Time
• The computational power of bounded arithmetic from the predicative viewpoint
• Implicit recursion-theoretic characterizations of counting classes
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)?
• Unfolding schematic systems
• Reflecting and unfolding
• A Remark on Independence Results for Sharply Bounded Arithmetic

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 Q3487327)