Logical Methods in Computer Science, Volume 1

Volume 1, Number 1, 2005

• Michael Huth:
  Labelled transition systems as a Stone space.
  
• Jörg Flum, Martin Grohe:
  Model-checking problems as a basis for parameterized intractability.
  
• Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik:
  Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
  
• Alan Jeffrey, Julian Rathke:
  Contextual equivalence for higher-order pi-calculus revisited.
  
• Víctor Dalmau:
  Linear datalog and bounded path duality of relational structures.
  
• Martin Grohe, Nicole Schweikardt:
  The succinctness of first-order logic on linear orders.
  

Volume 1, Number 2, 2005

• Venanzio Capretta:
  General recursion via coinductive types.
  
• Erik Palmgren:
  Internalising modified realisability in constructive type theory.
  
• Ulrich Berger:
  Strong normalization for applied lambda calculi.
  
• Dag Normann:
  Comparing hierarchies of total functionals.
  
• Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
  An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
  
• Sanjit A. Seshia, Randal E. Bryant:
  Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds.
  

Volume 1, Number 3, 2005

• Joseph Y. Halpern, Riccardo Pucella:
  Probabilistic Algorithmic Knowledge.
  
• Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
  Security Policies as Membranes in Systems for Global Computing.
  
• Bas Spitters:
  Almost periodic functions, constructively.
  
• Christopher Hardin:
  Modularizing the Elimination of r=0 in Kleene Algebra.