[FOM] Shipman seeks weaker complexity separations

[Martin Davis]

In that connection Steve Cook pointed out to me that it is known that
LogSPACE is known to be a proper subset of PSPACE. Hence in the chain from
LogSPACE to P to NP to the rungs of the poly-time hierarchy to PSPACE, at
least one inclusion must be proper.

That was some years ago. Anything at all stronger known today?

Martin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20150711/09e87467/attachment.html>