scientific article; zbMATH DE number 4160708
From MaRDI portal
zbMATH Open0707.03032MaRDI QIDQ3487327FDOQ3487327
Authors: Fernando Ferreira 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
inductionprovably recursive functionscomputable arithmeticbounded analog of primitive recursive arithmeticNP-induction on notationpolynomial time decidable predicates
First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (24)
- Bounded theories for polyspace computability
- Title not available (Why is that?)
- A simple proof of Parsons' theorem
- The counting hierarchy in binary notation
- Title not available (Why is that?)
- Nondeterministic polynomial-time computations and models of arithmetic
- Title not available (Why is that?)
- A recursion-theoretic characterisation of the positive polynomial-time functions
- An algebraic treatment of quantifier-free systems of arithmetic
- 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
- Title not available (Why is that?)
- The axiom of choice and combinatory logic
- Herbrand analyses
- Theories with self-application and computational complexity.
- The computational power of bounded arithmetic from the predicative viewpoint
- Computing in Finite Time
- Implicit recursion-theoretic characterizations of counting classes
- Title not available (Why is that?)
- Unfolding schematic systems
- What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)?
- A Remark on Independence Results for Sharply Bounded Arithmetic
- Reflecting and unfolding
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)
