Volume 140, Number 1, January 10, 1998

Special Issue from the Workshop on Logic and Computational Complexity (LCC), Indiana University, October 1994

• 
  Douglas A. Cenzer, Jeffrey B. Remmel: Complexity and Categoricity. 2-25
• 
  Erich Grädel, Yuri Gurevich: Metafinite Model Theory. 26-81
• 
  Jan Krajícek, Pavel Pudlák: Some Consequences of Cryptographical Conjectures for S¹₂ and EF. 82-94

Volume 140, Number 2, February 1, 1998

• 
  Mads Dam: Proving Properties of Dynamic Process Networks. 95-114
• 
  Ron van der Meyden: Common Knowledge and Update in Finite Environments. 115-157
• 
  Steven H. Low, Nicholas F. Maxemchuk: A Collusion Problem and Its Solution. 158-182
• 
  Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. 183-202
• 
  Aaron Feigelson, Lisa Hellerstein: Conjunctions of Unate DNF Formulas: Learning and Structure. 203-228
• 
  Anne Brüggemann-Klein, Derick Wood: One-Unambiguous Regular Languages. 229-253
• 
  Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. 254-283