22 August 2024: Due to technical disruption, we are experiencing some delays to publication. We are working to restore services and apologise for the inconvenience. For further updates please visit our website: https://www.cambridge.org/universitypress/about-us/news-and-blogs/cambridge-university-press-publishing-update-following-technical-disruption

Skip to main content Accessibility help

Home
Journals
Bulletin of Symbolic Logic
Volume 8

Bulletin of Symbolic Logic

Other actions
- Information
- - Add bookmark
  - Add alert
  - RSS Feed
  - Share

Published on behalf of Association of Symbolic Logic

Journal Home

Journal home
Journal information
Accepted manuscripts
FirstView articles
Latest issue
All issues
Most cited
Most read
Open access

Bulletin of Symbolic Logic

Refine listing

Actions for selected content:

Volume 8 - June 2002

Reviews

Frank O. Wagner. Simple theories. Mathematics and its applications, vol. 503. Kluwer Academic Publishers, Dordrecht, Boston, and London, 2000, xi + 260 pp.

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.

Oliver Aberth. Computable calculus. Academic Press, SanDiego, London, etc., 2001, xiii + 192 pp. + CD-ROM.

John Arnold Kalman. Automated reasoning with Otter. With a foreword by Larry Wos. Rinton Press, Princeton 2001, xv + 536 pp. + CD-ROM.

Lev D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of pure and applied logic, vol. 85 (1997), pp. 193–242.

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.

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.

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.

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.

Fred Sommers and George Englebretsen. An invitation to formal reasoning. The logic of terms. Ashgate, Aldershot, Burlington, Singapore, and Sydney, 2000, xvi + 260 pp.

Stevo Todorcevic. Topics in topology. Lecture notes in mathematics, vol. 1652. Springer, Berlin, Heidelberg, New York, etc., 1997, viii + 153 pp.

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.—

R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xv + 533 pp.

Sergei N. Artemov. Explicit provability and constructive semantics. The bulletin of symbolic logic, vol. 7 (2001), pp. 1–36.

Davide Sangiorgi and David Walker. The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge, New York, etc., 2001, xii + 580 pp.

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.

Bulletin of Symbolic Logic

Refine listing

Actions for selected content:

Save Search

Volume 8 - June 2002

Reviews