Bounded arithmetic and the polynomial hierarchy (Q1177041): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scheme of induction for bounded arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory / rank
 
Normal rank

Revision as of 10:04, 15 May 2024

scientific article
Language Label Description Also known as
English
Bounded arithmetic and the polynomial hierarchy
scientific article

    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