Advertisement

Table of contents

  1. Front Matter
  2. Klaus Ambos-Spies
    Pages 1-23
  3. Andreas Blass, Yuri Gurevich
    Pages 24-42
  4. W. Menzel, V. Sperschneider
    Pages 62-76
  5. V. Sperschneider
    Pages 88-102
  6. Dieter Spreen
    Pages 103-117
  7. Hans-Georg Carstens, Peter Päppinghaus
    Pages 162-182
  8. Anne Brüggemann, Lutz Priese, Dieter Rödding, Rüdiger Schätz
    Pages 198-236
  9. H. Kleine Büning
    Pages 254-269
  10. Bruno Scarpellini
    Pages 380-389
  11. M. R. Kramer, J. van Leeuwen
    Pages 397-407
  12. Pavel Pudlák
    Pages 421-445

About these proceedings

Keywords

Arithmetic Automatentheorie Entscheidung (Math.) Equivalence Komplexität (Math.) Logic NP Turing machine boolean satisfiability problem complexity mathematical logic proof turing degree

Bibliographic information

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