Abstract is missing.
- P-mitotic setsKlaus Ambos-Spies. 1-23
- Equivalence relations, invariants, and normal formsAndreas Blass, Yuri Gurevich. 24-42
- Recurrence relations for the number of labeled structures on a finite setChr. Blatter, Ernst Specker. 43-61
- Recursively enumerable extensions of R::1:: by finite functionsWolfgang Menzel, Volker Sperschneider. 62-76
- On the complement of one complexity class in anotherDiana Schmidt. 77-87
- The length-problemVolker Sperschneider. 88-102
- On r.e. inseparability of CPO index setsDieter Spreen. 103-117
- Arithmetical degrees of index sets for complexity classesKenneth W. Regan. 118-130
- Rudimentary relations and Turing machines with linear alternationHugo Volger. 131-136
- A critical-pair/completion algorithm for finitely generated ideals in ringsBruno Buchberger. 137-161
- Extensible algorithmsHans Georg Carstens, Peter Päppinghaus. 162-182
- Some reordering properties for inequality proof treesMichael M. Richter. 183-197
- Modular decomposition of automataAnne Brüggemann-Klein, Lutz Priese, Dieter Rödding, Rüdiger Schätz. 198-236
- Modular machines, undecidability and incompletenessDaniel E. Cohen. 237-247
- Universal Turing machines (UTM) and Jones-Matijasevich-maskingGisbert Hasenjaeger. 248-253
- Complexity of loop-problems in normed networksHans Kleine Büning. 254-269
- On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identityStål Aanderaa. 270-284
- Reductions for the satisfiability with a simple interpretation of the predicate variableMichael Deutsch. 285-311
- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)Martin Fürer. 312-319
- Implicit definability of finite binary trees by sets of equationsJerzy Tiuryn. 320-332
- Spektralproblem and completeness of logical decision problemsEgon Börger. 333-356
- Reduction to NP-complete problems by interpretationsElias Dahlhaus. 357-365
- Universal quantifiers and time complexity of random access machinesEtienne Grandjean. 366-379
- Second order spectraBruno Scarpellini. 380-389
- On the argument complexity of multiply transitive Boolean functionsUlrich Hedtstück. 390-396
- The VLSI complexity of Boolean functionsMark R. Kramer, Jan van Leeuwen. 397-407
- Fast parallel algorithms for finding all prime implicants for discrete functionsWalter Oberschelp. 408-420
- Bounds for Hodes-Specker theoremPavel Pudlák. 421-445
- Proving lower bounds of the monotone complexity of Boolean functionsIngo Wegener. 446-456