Annals of Pure and Applied Logic, Volume 130

Volume 130, Numbers 1-3, December 2004

• Gordon D. Plotkin:
  Foreword. 1-
  
• Markus Frick, Martin Grohe:
  The complexity of first-order and monadic second-order logic revisited. 3-31
  
• Guillem Godoy, Ashish Tiwari, Rakesh M. Verma:
  Deciding confluence of certain term rewriting systems in polynomial time. 33-59
  
• Stephan Kreutzer:
  Expressive equivalence of least and inflationary fixed-point logic. 61-78
  
• Olivier Laurent:
  Polarized games. 79-123
  
• C.-H. Luke Ong:
  An approach to deciding the observational equivalence of Algol-like languages. 125-171
  
• Martin Otto:
  Modal and guarded characterisation theorems over finite transition systems. 173-205
  
• Alex K. Simpson:
  Computational adequacy for recursive types in models of intuitionistic set theory. 207-275
  
• Michael Soltys, Stephen A. Cook:
  The proof complexity of linear algebra. 277-323
  
• Richard Statman:
  On the lambdaY calculus. 325-337