Annals of Pure and Applied Logic, Volume 133

Volume 133, Numbers 1-3, May 2005

• Wilfried Buchholz, Reinhard Kahle:
  Preface. 1-
  
• Samson Abramsky, Radha Jagadeesan:
  A game semantics for generic polymorphism. 3-37
  
• Klaus Aehlig, Felix Joachimski:
  Continuous normalization for the lambda-calculus and Gödel's. 39-71
  
• Luca Alberucci, Gerhard Jäger:
  About cut elimination for logics of common knowledge. 73-99
  
• Bahareh Badban, Jaco van de Pol:
  Zero, successor and equality in BDDs. 101-123
  
• Ulrich Berger:
  Uniform Heyting arithmetic. 125-148
  
• Egon Börger:
  Abstract State Machines: a unifying view of models of computation and of system design frameworks. 149-171
  
• Zoltán Ésik, Hans Leiß:
  Algebraically complete semirings and Greibach normal form. 173-203
  
• Ralph Matthes:
  Non-strictly positive fixed points for classical natural deduction. 205-230
  
• Grigori Mints, Ting Zhang:
  A proof of topological completeness for S4 in (0, 1). 231-245
  
• Karl-Heinz Niggl:
  Control structures in programs and computational complexity. 247-273
  
• Geoffrey E. Ostrin, Stanley S. Wainer:
  Elementary arithmetic. 275-292
  
• Robert F. Stärk:
  Axioms for strict and lazy functional programs. 293-318
  
• Wilfried Sieg, Clinton Field:
  Automated search for Gödel's proofs. 319-338