![](https://assets.cambridge.org/97805211/54338/cover/9780521154338.jpg)
- Cited by 5
-
Cited byCrossref Citations
This Book has been cited by the following publications. This list is generated based on data provided by Crossref.
Allender, Eric and Das, Bireswar 2014. Mathematical Foundations of Computer Science 2014. Vol. 8635, Issue. , p. 25.
Beckmann, Arnold and Buss, Samuel R. 2014. Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Transactions on Computational Logic, Vol. 15, Issue. 1, p. 1.
Atserias, Albert and Müller, Moritz 2015. Partially definable forcing and bounded arithmetic. Archive for Mathematical Logic, Vol. 54, Issue. 1-2, p. 1.
Beyersdorff, Olaf Chew, Leroy Mahajan, Meena and Shukla, Anil 2015. Automata, Languages, and Programming. Vol. 9134, Issue. , p. 180.
Bydžovský, Jan and Müller, Moritz 2020. Polynomial time ultrapowers and the consistency of circuit lower bounds. Archive for Mathematical Logic, Vol. 59, Issue. 1-2, p. 127.
- Publisher:
- Cambridge University Press
- Online publication date:
- November 2011
- Print publication year:
- 2010
- Online ISBN:
- 9781139107211
- Series:
- London Mathematical Society Lecture Note Series (382)