Table of contents

  1. Front Matter
  2. Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
    Pages 1-16
  3. K. H. Bläsius, U. Hedtstück
    Pages 17-26
  4. Corrado Böhm, Adolfo Piperno
    Pages 27-43
  5. François Bry, Rainer Manthey
    Pages 44-55
  6. Yuri Gurevich, James M. Morris
    Pages 81-101
  7. M. Heisel, W. Reif, W. Stephan
    Pages 102-117
  8. Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt
    Pages 129-137
  9. Katja Lenz, Ingo Wegener
    Pages 138-150
  10. Ulrich Löwen
    Pages 173-187
  11. Helena Rasiowa
    Pages 188-210
  12. Ralf Rehrmann, Lutz Priese
    Pages 211-222
  13. Reinhard Rinn, Britta Schinzel
    Pages 223-234
  14. P. H. Schmitt
    Pages 235-262
  15. Wolfgang Schönfeld
    Pages 263-272
  16. Uwe Schöning
    Pages 273-280

About these proceedings

Introduction

This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory. In addition there is what sometimes is called Philosophical Logic which deals with topics like nonclassical logics and which for historical reasons has been developed mainly at philosphical departments rather than at mathematics institutions. Today Computer Science challenges Logic in a new way. The theoretical analysis of problems in Computer Science for intrinsic reasons has pointed back to Logic. A broad class of questions became visible which is of a basically logical nature. These questions are often related to some of the traditional disciplines of Logic but normally without being covered adequately by any of them. The novel and unifying aspect of this new branch of Logic is the algorithmic point of view which is based on experiences people had with computers. The aim of the "Computer-Science Logic" workshop and of this volume is to represent the richness of research activities in this field in the German-speaking countries and to point to their underlying general logical principles.

Keywords

Boolean function Computer Erfüllbarkeitsproblem der Aussagenlogik Resolution algorithm algorithms complexity logic mathematical logic optimization programming programming language proof theory semantics verification

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-50241-6
  • Copyright Information Springer-Verlag 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-50241-8
  • Online ISBN 978-3-540-45960-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book