Dieter Rödding

from Wikipedia, the free encyclopedia

Dieter Rödding (born August 24, 1937 in Hattingen (Ruhr); † June 4, 1984 in Münster ) was a German mathematician who mainly dealt with mathematical logic.

In 1956 Rödding began his studies at the Westphalian Wilhelms University in Münster . In 1961 he received his doctorate with the dissertation supervised by Gisbert Hasenjaeger "Representative sentences about (in the Kalmár-Czillagian sense) elementary functions". In 1964 he completed his habilitation in Münster with the thesis "Theory of recursivity over the domain of finite sets of finite rank". In 1966 he succeeded Hans Hermes at the chair for mathematical logic and basic research and director of the institute of the same name at the Westphalian Wilhelms University of Münster.

Rödding became known for his results on the classification of recursive functions, on recursion types of classical predicate logic , on Scholz's spectrum problem as well as on number quantifiers in predicate logic and on the arithmetic hierarchy of Kleene-Mostowski. Rödding was one of the first to use a machine-oriented concept of complexity for the investigation of recursive functions and logical decision problems - long before the "birth" of computer science .

His students include Helmut Schwichtenberg , Thomas Ottmann, Elmar Cohors-Fresenborg, Egon Börger, Hans Georg Carstens, Lutz Priese and Hans Kleine Büning.

A complete list of Rödding's publications can be found in the obituary written by Egon Börger (DMV annual report 1987).

literature

  • Egon Börger: D. Rödding: An obituary. In: Annual report of the German Mathematicians Association. DMV. Vol. 89, No. 3, 1987, ISSN  0012-0456 , pp. 144-148, ( digitized version ).

Web links