6. CSL 1992: San Miniato, Italy

@proceedings{DBLP:conf/csl/1992,
  editor    = {Egon B{\"o}rger and
               Gerhard J{\"a}ger and
               Hans Kleine B{\"u}ning and
               Simone Martini and
               Michael M. Richter},
  title     = {Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy,
               September 28 - October 2, 1992, Selected Papers},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {702},
  year      = {1993},
  isbn      = {3-540-56992-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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