The Bulletin of Symbolic Logic

Volume 19, Issue 03, September 2013


Articles
  • Interpretability in Robinson's Q, by Fernando Ferreira and Gilda Ferreira, pages 289 — 317.
  • Algorithmic randomness and measures of complexity, by George Barmpalias, pages 318 — 350.
  • On formalism freeness: Implementing Gödel's 1946 Princeton bicentennial lecture, by Juliette Kennedy, pages 351 — 393.

  • Reviews, pages 394 — 401.

    In this issue:

  • B. Courcelle and J. Engelfriet, Graph structure and monadic second-order logic, reviewed by Achim Blumensath, page 394.
  • M. Colyvan, An introduction to the philosophy of mathematics, reviewed by Richard Pettigrew, page 396.
  • L. A. Levin, Some theorems on the algorithmic approach to probability theory and information theory (1971 Dissertation directed by A. N. Kolmogorov), reviewed by Jan Reimann, page 397.
  • Hrushovski constructions and randomizations in computable model theory, reviewed by Alexander G. Melnikov, page 399.

  • Meetings sponsored by the Association
  • XV Latin American Symposium on Mathematical Logic (SLALM 2012), Bogotá, Colombia, June 4—8, 2012, pages 402 — 424.
  • 19th Workshop on Logic, Language, Information and Computation (WoLLIC 2012), Buenos Aires, Argentina, September 3—6, 2012, pages 425 — 426.

  • Notices, pages 427 — 432.

  • The Association for Symbolic Logic holds the Copyright to the articles in the Bulletin of Symbolic Logic, and these articles cannot be reprinted without permission from the Association. They can be downloaded from this site for personal and educational uses only.