Computation Theory and Logic

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 149 Minimal pairs for polynomial time reducibilities
3. Altmetric Badge
   Chapter 150 Primitive recursive word-functions of one variable
4. Altmetric Badge
   Chapter 151 Existential fixed-point logic
5. Altmetric Badge
   Chapter 152 Unsolvable decision problems for PROLOG programs
6. Altmetric Badge
   Chapter 153 You have not understood a sentence, unless you can prove it
7. Altmetric Badge
   Chapter 154 On the minimality of K , F , and D or: Why löten is non-trivial
8. Altmetric Badge
   Chapter 155 A 5-color-extension-theorem
9. Altmetric Badge
   Chapter 156 Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables
10. Altmetric Badge
    Chapter 157 The benefit of microworlds in learning computer programming
11. Altmetric Badge
    Chapter 158 Skolem normal forms concerning the least fixpoint
12. Altmetric Badge
    Chapter 159 Spectral representation of recursively enumerable and coenumerable predicates
13. Altmetric Badge
    Chapter 160 Aggregating inductive expertise on partial recursive functions
14. Altmetric Badge
    Chapter 161 Domino threads and complexity
15. Altmetric Badge
    Chapter 162 Modelling of cooperative processes
16. Altmetric Badge
    Chapter 163 A setting for generalized computability
17. Altmetric Badge
    Chapter 164 First-order spectra with one variable
18. Altmetric Badge
    Chapter 165 On the early history of register machines
19. Altmetric Badge
    Chapter 166 Randomness, provability, and the separation of Monte Carlo Time and space
20. Altmetric Badge
    Chapter 167 Representation independent query and update operations on propositional definite Horn formulas
21. Altmetric Badge
    Chapter 168 Direct construction of mutually orthogonal latin squares
22. Altmetric Badge
    Chapter 169 Negative results about the length problem
23. Altmetric Badge
    Chapter 170 Some results on the complexity of powers
24. Altmetric Badge
    Chapter 171 The Turing complexity of AF C*-algebras with lattice-ordered K O
25. Altmetric Badge
    Chapter 172 Remarks on SASL and the verification of functional programming languages
26. Altmetric Badge
    Chapter 173 Numerical stability of simple geometric algorithms in the plane
27. Altmetric Badge
    Chapter 174 Communication with concurrent systems via I/0-procedures
28. Altmetric Badge
    Chapter 175 A class of exp-time machines which can be simulated by polytape machines
29. Altmetric Badge
    Chapter 176 αβγ-Automata realizing preferences
30. Altmetric Badge
    Chapter 177 Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen
31. Altmetric Badge
    Chapter 178 Grammars for terms and automata
32. Altmetric Badge
    Chapter 179 Relative konsistenz
33. Altmetric Badge
    Chapter 180 Segment translation systems
34. Altmetric Badge
    Chapter 181 First steps towards a theory of complexity over more general data structures
35. Altmetric Badge
    Chapter 182 On the power of single-valued nondeterministic polynomial time computations
36. Altmetric Badge
    Chapter 183 A concatenation game and the dot-depth hierarchy
37. Altmetric Badge
    Chapter 184 Do there exist languages with an arbitrarily small amount of context-sensitivity?
38. Altmetric Badge
    Chapter 185 The complexity of symmetric boolean functions