6. CSL 1992: San Miniato, Italy

• Stål Aanderaa:
  A Universal Turing Machine. 1-4
  
• Stål Aanderaa, Herman Ruge Jervell:
  Recursive Inseparability in Linear Logic. 5-13
  
• Sergei N. Artëmov, Tyko Straßen:
  The Basic Logic of Proofs. 14-28
  
• Matthias Baaz, Richard Zach:
  Algorithmic Structuring of Cut-free Proofs. 29-42
  
• Thomas Behrendt, Kevin J. Compton, Erich Grädel:
  Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. 43-60
  
• P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland:
  Linear Lambda-Calculus and Categorial Models Revisited. 61-84
  
• Alessandro Berarducci, Corrado Böhm:
  A Self-Interpreter of Lambda Calculus Having a Normal Form. 85-99
  
• Uwe Bosse:
  An "Ehrenfeucht-Fraïssé Game" for Fixpoint Logic and Stratified Fixpoint Logic. 100-114
  
• Nadia Creignou:
  The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 115-133
  
• Christian G. Fermüller, Alexander Leitsch:
  Model Building by Resolution. 134-148
  
• Tim Fernando:
  Comparative Transition System Semantics. 149-166
  
• Antonio Gavilanes-Franco, Francisca Lucio-Carrasco, Mario Rodríguez-Artalejo:
  Reasoning with Higher Order Partial Functions. 167-181
  
• Paola Glavan, Dean Rosenzweig:
  Communicating Evolving Algebras. 182-215
  
• Juan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
  On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming. 216-230
  
• Erich Grädel, Martin Otto:
  Inductive Definability with Counting on Finite Structures. 231-247
  
• Etienne Grandjean:
  Linear Time Algorithms and NP-Complete Problems. 248-273
  
• Yuri Gurevich, James K. Huggins:
  The Semantics of the C Programming Language. 274-308
  , Errata: CSL 1993: 334-336
• Furio Honsell, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
  A Theory of Classes for a Functional Language with Effects. 309-326
  
• Clemens Lautemann:
  Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates. 327-339
  
• Markus Marzetta:
  Universes in the Theory of Types and Names. 340-351
  
• John C. Mitchell, Andre Scedrov:
  Notes on Sconing and Relators. 352-378
  
• Ingo Schiermeyer:
  Solving 3-Satisfiability in Less Then 1, 579ⁿ Steps. 379-394
  
• Jan M. Smith:
  Kleene's Slash and Existence of Values of Open Terms in Type Theory. 395-402
  
• Robert F. Stärk:
  Negation-Complete Logic Programs. 403-409
  
• Iain A. Stewart:
  Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. 410-424
  
• Jerzy Tyszkiewicz:
  On Asymptotic Probabilities of Monadic Second Order Properties. 425-439