The Bulletin of Symbolic Logic

Volume 17, Issue 03, September 2011

Articles
  • V = L and intuitive plausibility in set theory. A case study, by Tatiana Arrigoni, pages 337 — 360.
  • On arbitrary sets and ZFC, by José Ferreirós, pages 361 — 393.
  • Alan Turing and the foundations of computable analysis, by Guido Gherardi, pages 394 — 430.
  • Open questions in reverse mathematics, by Antonio Montalbán, pages 431 — 454.
    •

    Communications
  • A new proof of Friedman's conjecture, by Liang Yu, pages 455 — 461.
    •
  • Reviews, pages 462 — 470.
    •

    In this issue:

  • S. Cook and P. Nguyen, Logical foundations of proof complexity, reviewed by Albert Atserias, page 462.
  • M. Lerman, A framework for priority arguments, reviewed by George Barmpalias, page 464.
  • I. Farah, All automorphisms of the Calkin algebra are inner, reviewed by Ernest Schimmerling, page 467.
    •

    Obituaries
  • In Memoriam: Gregory Hjorth, 1963—2011, by Alexander S. Kechris, pages 471 — 477.
    •

    Meetings sponsored by the Association
  • 6th Conference on Computability in Europe “Programs, proofs, processes", University of Azores, Ponta Delgada, Azores, Portugal, June 30—July 4, 2010, pages 478 — 479.
  • 17th Workshop on Logic, Language, Information and Computation (WoLLIC 2010), Brasília, Brazil, July 6—9, 2010, pages 480 — 481.
    •
  • Notices, pages 482 — 487.
    •
    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.