The bounded arithmetic hierarchy

DOI10.1016/S0019-9958(78)90257-7MaRDI QIDQ4152523zbMATH OpenFDO

Authors Keith Harrow

Publication date 1978

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(78)90257-7

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Cited in

(8)

• Elementary functions and loop programs
• Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
• Elementary realizability
• The role of rudimentary relations in complexity theory
• Positive rudimentarity of the graphs of Ackermann and Grzegorczyk
• Functions definable by arithmetic circuits
• An arithmetical characterization of NP
• Bounded arithmetic, proof complexity and two papers of Parikh

This page was built for publication: The bounded arithmetic hierarchy

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