scientific article
From MaRDI portal
Publication:3487327
zbMath0707.03032MaRDI QIDQ3487327
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
inductionprovably recursive functionscomputable arithmeticbounded analog of primitive recursive arithmeticNP-induction on notationpolynomial time decidable predicates
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)
Related Items (14)
Binary models generated by their tally part ⋮ What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)? ⋮ Herbrand analyses ⋮ An algebraic treatment of quantifier-free systems of arithmetic ⋮ The provably terminating operations of the subsystem PETJ of explicit mathematics ⋮ Theories with self-application and computational complexity. ⋮ Bounded theories for polyspace computability ⋮ The axiom of choice and combinatory logic ⋮ A simple proof of Parsons' theorem ⋮ The counting hierarchy in binary notation ⋮ Unfolding Schematic Systems ⋮ A recursion-theoretic characterisation of the positive polynomial-time functions ⋮ Implicit recursion-theoretic characterizations of counting classes ⋮ Reflecting and unfolding
This page was built for publication:
