Computation Theory and Logic
Springer Science & Business Media, Jul 29, 1987 - Computers - 442 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
algebra algorithm arithmetic expressions ascending chain condition automata automaton binary bounded C*-algebras circuits complete complexity classes computation concept construction decision problems Dedekind defined denote deterministic E+LFP elements equivalent example existential finite first-order first-order logic function f geometric given graph Hence hierarchy Hilbert Horn clause implies induction infinite input integer Isba-evaluation isomorphic Knoten language least fixpoint Lemma length logic Logik machine numbers Math mathematical Mathematik mathematische minimal minimal pair Monte Carlo MV-algebra nondeterministic notation obtain operations opt-form oracle oracle set output pair polynomial time-bounded pr-hard predicate problem proof Proposition prove pupils quantifier query recursive functions recursive set reducible reduction ring register machine relation resp result SASL satisfying behaviour sentence sequence simulation Skolem normal form stage s+1 string structure subset symbols tape Theorem theory Turing machines Turing transducer unary value-schedule variables Zahlen