Logic and Machines: Decision Problems and Complexity

Proceedings of the Symposium “Rekursive Kombinatorik” held from May 23 – 28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen

  • Editors
  • E. Börger
  • G. Hasenjaeger
  • D. Rödding

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

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

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
  • About this book
Industry Sectors
Pharma
Automotive
Finance, Business & Banking
Consumer Packaged Goods
Aerospace
Oil, Gas & Geosciences