Mathematical Sciences: Research in Mathematical Logic

该项目包括递归理论的研究， 对计算相对复杂性的研究，构造性的 数学，逻辑，以及它们与计算机科学的关系。 在 纯粹的递归理论领域，主要的主题是 递归复杂度结构的研究 可逼近集和有效逼近集。 的 与计算机科学相关的复杂性理论问题 包括各种多项式时间问题考虑：纯 结构理论及其在代数、分析、逻辑和 其他领域。 涉及逻辑和计算机科学的主题 以直觉主义数学为中心， 从形式化的数学证明中提取验证过的程序 存在

This project includes research in recursion theory, which is the study of relative complexity of computation, constructive mathematics, logic, and their relations to computer science. In the purely recursion-theoretic areas, the major topics are the study of the structure of the complexity degrees of recursively enumerable sets and effectively approximable ones. The complexity theoretic problems connected with computer science include various polynomial-time problem considerations: pure structure theory and applications to algebra, analysis, logic and other areas. The topics involving logic and computer science center on intuitionistic mathematics as the proper framework for extracting verified programs from formal mathematical proofs of existence.