Skip to main content
  • Conference proceedings
  • © 1990

CSL '89

3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 440)

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (28 papers)

  1. Front Matter

  2. Honest polynomial-time degrees of elementary recursive sets

    • Klaus Ambos-Spies, Dongping Yang
    Pages 1-15
  3. On the verification of modules

    • G. Antoniou, V. Sperschneider
    Pages 16-35
  4. Set-theoretic reductions of Hilbert's tenth problem

    • D. Cantone, V. Cutello, A. Policriti
    Pages 65-75
  5. On test classes for universal theories

    • Bernd I. Dahn
    Pages 90-97
  6. Effectively given information systems and domains

    • Manfred Droste, Rüdiger Göbel
    Pages 116-142
  7. Algebraic operational semantics and Occam

    • Yuri Gurevich, Lawrence S. Moss
    Pages 176-192
  8. Propositional provability and models of weak arithmetic

    • Jan Krajíček, Pavel Pudlák
    Pages 193-210
  9. Deciding Horn classes by hyperresolution

    • Alexander Leitsch
    Pages 225-241
  10. Ω-branching programs of bounded width

    • Christoph Meinel
    Pages 242-253
  11. Reducibility of monotone formulas to μ-formulas

    • Daniele Mundici
    Pages 267-270

About this book

This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science, e.g. in complexity, data base theory, logic programming, artificial intelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access