Electronic Notes in Theoretical Computer Science, Volume 84

Volume 84, 2003

• Ruy J. G. B. de Queiroz, Elaine Pimentel, Lucília Figueiredo:
  Preface.
  
• Eric Allender:
  NL-printable sets and Nondeterministic Kolmogorov Complexity.
  
• Lauri Hella:
  Quantifying over Quantifiers.
  
• Jean-Baptiste Joinet:
  Calculus of structures and proof-nets.
  
• Dale Miller:
  Encryption as an abstract data type.
  
• Hans Rott:
  Economy and economics in the logic of theory change.
  
• Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini:
  Intersection Types and Computational Rules.
  
• Denis Béchet, Annie Foret:
  k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
  
• Benjamín René Callejas Bedregal, André Nies:
  Lowness Properties of Reals and Hyper-Immunity.
  
• Nachum Dershowitz, Iddo Tzameret:
  Gap Embedding for Well-Quasi-Orderings.
  
• Marcelo Finger, Renata Wassermann:
  The Universe of Approximations.
  
• Francisco Gutiérrez, Blas C. Ruiz:
  Cut Elimination in a Class of Sequent Calculi for Pure Type Systems.
  
• Sven Hartmann, Sebastian Link:
  On Functional Dependencies in Advanced Data Models.
  
• Lauri Hella, Jose Maria Turull Torres:
  Expressibility of Higher Order Logics.
  
• Yngve Lamo, Michal Walicki:
  Quantifier-free logic for multialgebraic theories.
  
• Renata Hax Sander Reiser, Antônio Carlos da Rocha Costa, Graçaliz Pereira Dimuro:
  A Programming Language for the Interval Geometric Machine.
  
• Lutz Straßburger:
  System NEL is Undecidable.
  
• Yoshitaka Suzuki, Satoshi Tojo:
  Fusion of Pedigreed Preferential Relations.
  
• Leonardo B. Vana, Marcelo da S. Corrêa:
  A Tableau Method for the Lambek Calculus based on a Matrix Characterization.
  
• Marek Zaionc:
  Statistics of implicational logic.
  
• Richard Zuber:
  Some properties of intercategorial entailment.