Bounded arithmetic and the polynomial hierarchy (Q1177041): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0168-0072(91)90043-l / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071204190 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 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
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
