Computer Science Logic

This volume presents the proceedings of the Computer Science
Logic Workshop CSL '92, held in Pisa, Italy, in
September/October 1992. CSL '92 was the sixth of the series
and the first one held as Annual Conference of the European
Association for Computer Science Logic (EACSL). Full
versions of the workshop contributions were collected after
their presentation and reviewed. On the basis of 58 reviews,
26 papers were selected for publication, and appear here in
revised final form.
Topics covered in the volume include: Turing machines,
linear logic, logic of proofs, optimization problems, lambda
calculus, fixpoint logic, NP-completeness, resolution,
transition system semantics, higher order partial functions,
evolving algebras, functional logic programming, inductive
definability, semantics of C, classes for a functional
language, NP-optimization problems, theory of types and
names, sconing and relators, 3-satisfiability, Kleene's
slash, negation-complete logic programs, polynomial-time
oracle machines, and monadic second-order properties.