Bounded arithmetic and the polynomial hierarchy (Q1177041)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 12856
Language Label Description Also known as
default for all languages
No label defined
    English
    Bounded arithmetic and the polynomial hierarchy
    scientific article; zbMATH DE number 12856

      Statements

      Bounded arithmetic and the polynomial hierarchy (English)
      0 references
      0 references
      0 references
      0 references
      25 June 1992
      0 references
      The authors assume familarity with the book of \textit{S. Buss} [Bounded arithmetic (1986; Zbl 0649.03042)]. They show that (1) \(T_ 2^ i=S_ 2^{i+1}\) implies \(\Sigma^ p_{i+1}\subseteq\Delta^ p_{i+1}/\text{poly}\). (For this result they use a Herbrand-type witnessing theorem for \(\exists\forall\exists\Pi^ b_ i\)-formulas provable in \(T^ i_ 2\), where the witnessing functions are in \(\square^ p_{i+1}\)). (2) \(S_ 2(\alpha)\) and \(I\Delta_ 0(f)\) are not finitely axiomatizable.
      0 references
      Herbrand-type witnessing theorem
      0 references

      Identifiers