The Bulletin of Symbolic Logic, Volume 12

Volume 12, Number 1, March 2006

• Ignacio Jané:
  What is Tarski's common concept of consequence? 1-42
  
• Dag Normann:
  Computing with functionals - computability theory or computer science? 43-59
  
• Bernard Linsky, Edward N. Zalta:
  What is neologicism? 60-99
  
• H. Jerome Keisler:
  Nonstandard arithmetic and reverse mathematics. 100-125
  

Volume 12, Number 2, June 2006

• Andreas Weiermann:
  Classifying the Provably Total Functions of PA. 177-190
  
• Wesley Calvert, Julia F. Knight:
  Classification from a Computable Viewpoint. 191-218
  
• John Corcoran:
  Schemata: The Concept of Schema in the History of Logic. 219-240
  
• Bohuslav Balcar, Thomas Jech:
  Weak Distributivity, a Problem of von Neumann and the Mystery of Measurability. 241-266
  
• Liesbeth De Mol:
  Closing the Circle: An Analysis of Emil Post's Early Work. 267-289
  

Volume 12, Number 3, September 2006

• Richard A. Shore:
  Degree Structures: Local and Global Investigations. 369-389
  
• Joseph S. Miller, André Nies:
  Randomness and Computability: Open Questions. 390-410
  
• Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn:
  Calibrating Randomness. 411-491
  

Volume 12, Number 4, December 2006

• Kai Hauser:
  Gödel's Program Revisited, Part I: The Turn to Phenomenology. 529-590
  

• Sy-David Friedman:
  Internal Consistency and the Inner Model Hypothesis. 591-600