U.S.-Federal Republic of Germany Cooperative Research in Mathematical Logic

该奖项支持对联邦的几次短期研究访问 《德国共和国》，罗伯特·索尔和西奥多·斯拉曼著， 芝加哥大学和耶鲁大学的Steffen Lempp 与海德堡大学的Klaus Ambos-Spies合作 数学逻辑的几个主题。 特别是，他们将 研究递归函数理论和 计算 芝加哥大学（伦普最近在那里 获得博士学位）是这些主题的主要研究中心， 这些美国数学家已经产生了一些杰出的 对外地的贡献。 德国有着悠久而卓越的 在这个领域的传统，以及和教授Ambos-Spies是一个 递归函数理论的领军人物 他还做了 递归方法应用的广泛研究 函数论到计算复杂性 既往间歇性 Soare教授和Ambos-Spies教授之间的合作 相互促进和富有成效。 拟议的访问将允许 他们之间更频繁的合作，并包括两个 其他美国数学家的工作是直接相关的， 埋伏间谍 数理逻辑，特别是递归函数理论， 计算理论最近在美国非常活跃， 国外 递归理论起源于一种试图将它 一个集合是机械可定义的，因此它具有 应用于理论计算机科学和 计算复杂度

This award supports several short term research visits to the Federal Republic of Germany by Robert Soare and Theodore Slaman of the University of Chicago and Steffen Lempp of Yale University in order to collaborate with Klaus Ambos-Spies of the University of Heidelberg in several topics of mathematical logic. In particular, they will pursue research on recursive function theory and the theory of computation. The University of Chicago (where Lempp recently obtained his PhD) is a major center of research on these topics and these U.S. mathematicians have produced some outstanding contributions to the field. Germany has a long and distinguished tradition in this field as well, and Professor Ambos-Spies is a leading figure in recursive function theory there. He has also done extensive research in applications of the methods of recursive function theory to computational complexity. Previous intermittent collaboration between Professors Soare and Ambos-Spies has been mutually stimulating and productive. The proposed visits will allow more frequent collaboration between them and the inclusion of two other U.S. mathematicians whose work is directly relevant to that of Ambos-Spies. Mathematical logic and particularly recursive function theory and the theory of computation have recently been very active in the U.S. and abroad. Recursion theory arises from an attempt to formalize what it means for a set to be mechanically definable, and thus it has applications to theoretical computer science and the theory of computational complexity.