Abstract
By Theorems 4.2.1 and 4.2.2 we have that, for every n ∈ N and every set A, the following statements are equivalent.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gasarch, W.I., Martin, G.A. (1999). Separating and Collapsing Classes. In: Bounded Queries in Recursion Theory. Progress in Computer Science and Applied Logic, vol 16. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0635-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0635-4_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6848-2
Online ISBN: 978-1-4612-0635-4
eBook Packages: Springer Book Archive