Computation Theory and Logic

1. Direct construction of mutually orthogonal latin squares

   • H. Kull, E. Specker

   Pages 224-236

2. Negative results about the length problem

   • Martin Kummer

   Pages 237-248

3. Some results on the complexity of powers

   • T. Lickteig, H. Volger

   Pages 249-255

4. The Turing complexity of AF C*-algebras with lattice-ordered KO

   • Daniele Mundici

   Pages 256-264

5. Remarks on SASL and the verification of functional programming languages

   • Klaus Nökel, Robert Rehbold, Michael M. Richter

   Pages 265-276

6. Numerical stability of simple geometric algorithms in the plane

   • Thomas Ottmann, Gerald Thiemt, Christian Ullrich

   Pages 277-293

7. Communication with concurrent systems via I/0-procedures

   • Lutz Priese

   Pages 294-305

8. A class of exp-time machines which can be simulated by polytape machines

   • B. Scarpellini

   Pages 306-319

9. αβγ-Automata realizing preferences

   • I. Schwank

   Pages 320-333

10. Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen

    • H. Schwichtenberg

    Pages 334-348

11. Grammars for terms and automata

    • D. Siefkes

    Pages 349-359

12. Relative konsistenz

    • Wilfried Sieg

    Pages 360-381

13. Segment translation systems

    • Wolfgang A. Slaby

    Pages 382-390

14. First steps towards a theory of complexity over more general data structures

    • Volker Sperschneider

    Pages 391-402

15. On the power of single-valued nondeterministic polynomial time computations

    • Dieter Spreen, Hans Stahl

    Pages 403-414

16. A concatenation game and the dot-depth hierarchy

    • Wolfgang Thomas

    Pages 415-426

17. Do there exist languages with an arbitrarily small amount of context-sensitivity?

    • Klaus W. Wagner

    Pages 427-432

18. The complexity of symmetric boolean functions

    • Ingo Wegener

    Pages 433-442

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.

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

Policies and ethics