Advertisement

Table of contents

  1. Front Matter
  2. Andreas Blass, Yuri Gurevich
    Pages 20-36
  3. Anne Brüggemann-Klein, Rolf Klein
    Pages 59-66
  4. Hans-Georg Carstens
    Pages 67-77
  5. Anne Drosdol, Britta Schinzel
    Pages 117-130
  6. H. -D. Ebbinghaus
    Pages 131-142
  7. Erwin Engeler
    Pages 143-153
  8. G. Germano, S. Mazzanti
    Pages 154-165
  9. E. Grandjean
    Pages 166-180
  10. G. Hasenjaeger
    Pages 181-188
  11. Martin Kummer
    Pages 237-248
  12. T. Lickteig, H. Volger
    Pages 249-255
  13. Klaus Nökel, Robert Rehbold, Michael M. Richter
    Pages 265-276
  14. Thomas Ottmann, Gerald Thiemt, Christian Ullrich
    Pages 277-293
  15. I. Schwank
    Pages 320-333
  16. D. Siefkes
    Pages 349-359
  17. Wilfried Sieg
    Pages 360-381
  18. Wolfgang A. Slaby
    Pages 382-390
  19. Wolfgang Thomas
    Pages 415-426

About this book

Introduction

This volume contains 37 invited research papers collected in memory of Dieter Rödding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Rödding's scientific interests.

Keywords

Algorithms Automat Boolean function Variable algorithm automata complexity computer computer science data structure data structures logic programming programming language verification

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-18170-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 1987
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-18170-5
  • Online ISBN 978-3-540-47795-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site