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.

Скачать книгу бесплатно (djvu, 4.50 Mb)

---

Читать «Computation Theory and Logic»