Abstract is missing.
- Minimal Pairs for Polynomial Time ReducibilitiesKlaus Ambos-Spies. 1-13
- Primitive Recursive Word-Functions of one VariableGünter Asser. 14-19
- Existential Fixed-Point LogicAndreas Blass, Yuri Gurevich. 20-36
- Unsolvable Decision Problems for Prolog ProgramsEgon Börger. 37-48
- You have not understodd a sentence, unless you can prove itHans-Jürgen Brämik. 49-58
- On the Minimality of ::::K::::, ::::F:::: and ::::D:::: or: Why Löten is Non-TrivialAnne Brüggemann-Klein, Rolf Klein. 59-66
- A 5-Color-Extension-TheoremHans Georg Carstens. 67-77
- Closure Relations, Buchberger s Algorithm, and Polynomials in Infinitely Many VariablesDaniel E. Cohen. 78-87
- The Benefit of Microworlds inLearning Computer ProgrammingElmar Cohors-Fresenborg. 88-100
- Skolem Normal Forms Concerning the Least FixpointElias Dahlhaus. 101-106
- Spectral Representation of Recursively Enumerable and Coenumerable PredicatesM. Deutsch. 107-116
- Aggregating Inductive Expertise on Partial Recursive FunctionsAnne Drosdol, Britta Schinzel. 117-130
- Domino Threads and ComplexityHeinz-Dieter Ebbinghaus. 131-142
- Modelling of Cooperative ProcessesErwin Engeler. 143-153
- A Setting for Generalized ComputabilityGiorgio Germano, Stefano Mazzanti. 154-165
- First-order Spectra with One VariableEtienne Grandjean. 166-180
- On the Early History of Register MachinesGisbert Hasenjaeger. 181-188
- Randomness, Provability, and the Seperation of Monte Carlo Time and SpaceMarek Karpinski, Rutger Verbeek. 189-207
- Representation Independent Query and Update Operations on Propositional Definite Horn FormulasHans Kleine Büning, Theodor Lettmann. 208-223
- Direct Construction of Mutually Orthogonal Latin SquareH. Kull, Ernst Specker. 224-236
- Negative Results about the Length ProblemMartin Kummer. 237-248
- Some Results on the Complexity of PowersThomas Lickteig, Hugo Volger. 249-255
- The Turing Complexity of AF C:::*:::-algebras with Lattice-ordered K::o::Daniele Mundici. 256-264
- Remarks on SASL and the Verification of Functional Programming LanguagesKlaus Nökel, Robert Rehbold, Michael M. Richter. 265-276
- Numerical Stability of simple Geometric Algorithms in the planeThomas Ottmann, Gerald Thiemt, Christian P. Ullrich. 277-293
- Communication with Concurrent Systems via I/O-ProceduresLutz Priese. 294-305
- A Class of EXP-Time Machines which can be Simulated by Polytape MachinesBruno Scarpellini. 306-319
- Alpha-Beta-Gamma - Automata Realizing PreferencesI. Schwank. 320-333
- Ein einfaches Verfahren zur Normalisierung unendlicher HerleitungenHelmut Schwichtenberg. 334-348
- Grammars for Terms and Automata - On a book by the late J. Richard BüchiDirk Siefkes. 349-359
- Relative KonsistenzWilfried Sieg. 360-381
- Segment Translation SystemsWolfgang A. Slaby. 382-390
- First Steps towards a Theory of Complexity over more General Data StructuresVolker Sperschneider. 391-402
- On the Power of Single-Valued Nondeterministic Polynomial Time ComputationsDieter Spreen, Hans Stahl. 403-414
- A Concatenation Game and the Dot-Depth HierarchyWolfgang Thomas. 415-426
- Do There Exist Languages With an Arbitrarily Small Amount of Context-SensitivityKlaus W. Wagner. 427-432
- The Complexity of Symmetric Boolean FunctionsIngo Wegener. 433-442