Skip to main content
SpringerLink
Log in

CSL '89

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

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hans Kleine Büning
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Michael M. Richter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  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. A logical operational semantics of full Prolog

    • Egon Börger
    Pages 36-64

  5. Set-theoretic reductions of Hilbert's tenth problem

    • D. Cantone, V. Cutello, A. Policriti
    Pages 65-75

  6. The complexity of subtheories of the existential linear theory of reals

    • Elias Dahlhaus
    Pages 76-89

  7. On test classes for universal theories

    • Bernd I. Dahn
    Pages 90-97

  8. Generalizing allowedness while retaining completeness of SLDNF-resolution

    • Hendrik Decker, Lawrence Cavedon
    Pages 98-115

  9. Effectively given information systems and domains

    • Manfred Droste, Rüdiger Göbel
    Pages 116-142

  10. Davis-Putnam resolution versus unrestricted resolution

    • Andreas Goerdt
    Pages 143-162

  11. On logical descriptions of some concepts in structural complexity theory

    • Erich Grädel
    Pages 163-175

  12. Algebraic operational semantics and Occam

    • Yuri Gurevich, Lawrence S. Moss
    Pages 176-192

  13. Propositional provability and models of weak arithmetic

    • Jan Krajíček, Pavel Pudlák
    Pages 193-210

  14. Polymorphic recursion and semi-unification

    • Hans Leiß
    Pages 211-224

  15. Deciding Horn classes by hyperresolution

    • Alexander Leitsch
    Pages 225-241

  16. Ω-branching programs of bounded width

    • Christoph Meinel
    Pages 242-253

  17. A predicate calculus with control of derivations

    • Daniel Mey
    Pages 254-266

  18. Reducibility of monotone formulas to μ-formulas

    • Daniele Mundici
    Pages 267-270

  19. New ways for developing proof theories for first-order multi modal logics

    • Hans Jürgen Ohlbach
    Pages 271-308

  20. On the representation of data in lambda-calculus

    • Michel Parigot
    Pages 309-321
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation