Computer Science Logic: 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected PapersEgon Börger "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."--PUBLISHER'S WEBSITE. |
Contents
I | 1 |
II | 5 |
III | 14 |
IV | 29 |
V | 43 |
VI | 85 |
VII | 100 |
VIII | 115 |
XVIII | 231 |
XX | 248 |
XXII | 274 |
XXIV | 309 |
XXV | 327 |
XXVII | 340 |
XXVIII | 352 |
XXIX | 379 |
Other editions - View all
Common terms and phrases
A₁ algorithm arity assume atomic axioms binary binary relation canonical cartesian closed category clauses coalgebras comma category complete Computer Science constants construction corresponding Datalog defined Definition denoted domain endif equations equivalent evaluation evolving algebra example expression extended first-order logic fixpoint logic formula free variables function symbols functor given graph iml-category induction input integer interpretation K₁ K₂ lambda calculus lambda terms Lemma linear logic modal monadic monadic logic morphisms n-tuples natural numbers natural transformations notion NP-complete objects operators oracle P₁ partial function polynomial problems properties Proposition prove quantifiers recursive relation resp satisfiable semantics semi-unification sequent sequent calculus signature statement structure subset T₁ tableau tasks Theorem theory transformations transition rules tuple Turing machine type theory unary universe Value CurTask x₁ y₁