scientific article; zbMATH DE number 517079

zbMath0793.68064MaRDI QIDQ4282609

Jan Johannsen

Publication date: 17 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial hierarchysharply bounded polynomial induction

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

The strength of sharply bounded induction requires MSP ⋮ A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications ⋮ Multifunction algebras and the provability of \(PH\downarrow\) ⋮ The strength of sharply bounded induction ⋮ Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) ⋮ A note on sharply bounded arithmetic

This page was built for publication: