Abstract
We present a new, combinatorial proof of the classical theorem that the analytic sets are not closed under complement. Possible connections with questions in complexity theory are discussed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, "Σ 11 -formulae on finite structures", Annals of Pure and Applied Logic 24, 1983, 1–48.
M. Furst, J.B. Saxe, M. Sipser, "Parity, circuits, and the polynomial time hierarchy", Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981, 260–270.
K. Kuratowski, Topology, Academic Press, 1966.
Y. Moschavakis, Descriptive Set Theory, North-Holland, 1980.
M. Sipser, "On polynomial versus exponential growth", unpublished report, 1981.
M. Sipser, "Borel sets and circuit complexity", Proceedings of the 15th Annual Symposium on Theory of Computing, 1983, 61–69.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sipser, M. (1984). A topological view of some problems in complexity theory. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030341
Download citation
DOI: https://doi.org/10.1007/BFb0030341
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive