Contents
Reviews
Frank O. Wagner. Simple theories. Mathematics and its applications, vol. 503. Kluwer Academic Publishers, Dordrecht, Boston, and London, 2000, xi + 260 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 522-524
-
- Article
- Export citation
R. Dougherty and A. S. Kechris. Hausdorff measures and sets of uniqueness for trigonometric series. Proceedings of the American Mathematical Society, vol. 105 (1989), pp. 894–897. - Alexander S. Kechris and Alain Louveau. Covering theorems for uniqueness and extended uniqueness sets. Colloquium mathematicum, vol. 59 (1990), pp. 63–79. - Alexander S. Kechris. Hereditary properties of the class of closed sets of uniqueness for trigonometric series. Israel journal of mathematics, vol. 73 (1991), pp. 189–198. - A. S. Kechris and A. Louveau. Descriptive set theory and harmonic analysis. The journal of symbolic logic, vol. 57 (1992), pp. 413–441.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 94-95
-
- Article
- Export citation
Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 301-302
-
- Article
- Export citation
Oliver Aberth. Computable calculus. Academic Press, SanDiego, London, etc., 2001, xiii + 192 pp. + CD-ROM.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 426-428
-
- Article
- Export citation
John Arnold Kalman. Automated reasoning with Otter. With a foreword by Larry Wos. Rinton Press, Princeton 2001, xv + 536 pp. + CD-ROM.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 428-429
-
- Article
- Export citation
Advances in modal logic, Volume 1, edited by Marcus Kracht, Maarten de Rijke, Heinrich Wansing, and Michael Zakharyaschev, CSLI lecture notes, no. 87, Center for the Study of Language and Information, Stanford 1998, also distributed by Cambridge University Press, New York, xvi + 392 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 95-97
-
- Article
- Export citation
Lev D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of pure and applied logic, vol. 85 (1997), pp. 193–242.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 302-303
-
- Article
- Export citation
M. Holz, K. Steffens, and E. Weitz. Introduction to cardinal arithmetic. Birkhäuser advanced texts. Birkhäuser Verlag, Basel, Boston, and Berlin, 1999, vii + 304 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 524-526
-
- Article
- Export citation
Uri Abraham, Matatyahu Rubin, and Saharon Shelah. On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types. Annals of pure and applied logic, vol. 29 (1985), pp. 123–206.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 303-305
-
- Article
- Export citation
Melvin Fitting and Richard L. Mendelsohn. First-order modal logic. Synthese library, vol. 277. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1998, xii + 287 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 429-431
-
- Article
- Export citation
Fred Sommers and George Englebretsen. An invitation to formal reasoning. The logic of terms. Ashgate, Aldershot, Burlington, Singapore, and Sydney, 2000, xvi + 260 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 97-100
-
- Article
- Export citation
Stevo Todorcevic. Topics in topology. Lecture notes in mathematics, vol. 1652. Springer, Berlin, Heidelberg, New York, etc., 1997, viii + 153 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 526-528
-
- Article
- Export citation
Proof theory, History and philosophical significance, edited by Vincent F. Hendricks, Stig Andur Pedersen, and Klaus Frovin Jørgensen, Synthese library, vol. 292, Kluwer Academic Publishers, Dordrecht, Boston, and London, 2000, xii + 244 pp.—
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 431-432
-
- Article
- Export citation
Z. Szentmiklóssy. S-spaces and L-spaces under Martin's axiom. Topology, Volume II, edited by A. Császár, Colloquia mathematica Societatis János Bolyai, no. 23, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1980, pp. 1139–1145. - Zoltán Balogh. On compact Hausdorff spaces of countable tightness. Proceedings of the American Mathematical Society, vol. 105 (1989), pp. 755–764.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 306-307
-
- Article
- Export citation
R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xv + 533 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 528-529
-
- Article
- Export citation
Alasdair Urquhart. The complexity of linear logic with weakening. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Hájek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000, pp. 500–515.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 100-101
-
- Article
- Export citation
Sergei N. Artemov. Explicit provability and constructive semantics. The bulletin of symbolic logic, vol. 7 (2001), pp. 1–36.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 432-433
-
- Article
- Export citation
Davide Sangiorgi and David Walker. The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge, New York, etc., 2001, xii + 580 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 530-531
-
- Article
- Export citation
Richard L. Epstein and Walter A. Carnielli. Computability. Computable functions, logic, and the foundations of mathematics. The Wadsworth & Brooks/Cole mathematics series. Wadsworth&Brooks/Cole Advanced Books & Software, Pacific Grove, Calif., 1989, xvii + 297 pp. - Richard L. Epstein and Walter A. Carnielli. Computability. Computable functions, logic, and the foundations of mathematics. Second edition of the preceding. Wadsworth, Belmont, Calif., etc., 2000, xii + 299 + 38 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 101-104
-
- Article
- Export citation
Maxim R. Burke and Menachem Magidor. Shelah's pcf theory and its applications. Annals of pure and applied logic, vol. 50 (1990), pp. 207–254.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 307-308
-
- Article
- Export citation