## A second step toward the polynomial hierarchy

- Theodore P. Baker, Alan L. Selman
- 17th Annual Symposium on Foundations of Computer…
- 1976

1 Excerpt

- Published 2014

We consider under the assumption PINP questions concerning the structure of the lattice of NP sets together with the sublattice P. We show that two questions which are slightly more complex than the known splitting properties of this lattice cannot be settled by arguments which relativize. The two questions which we consider are whether every infinite NP set contains an infinite P subset and whether there exists an NP-simple set. We construct several oracles, all of which make P I NP, and which in addition make the above-mentioned statements either true or false. In particular we give a positive answer to the question, raised by Bennett and Gill (1981), whether an oracle B exists making PBINPt and such that every infinite set in NPB has an infinite subset in PB. The constructions of the oracles are finite injury priority arguments.

@inproceedings{Homer2014TheLO,
title={The Lattice of Np Sets},
author={Steven Homer},
year={2014}
}