Computable Stability Theory

安德鲁斯提出了一个跨越经典可计算理论，经典模型理论，特别是可计算理论和模型理论之间的相互作用的研究计划。更具体地说，所提出的研究将发展可计算稳定性理论的新兴领域，其中稳定性理论的方法起着关键作用是研究一阶理论的有效性质。稳定性理论是模型理论的一部分，它关注数学对象的潜在几何或结构性质。一般来说，数学对象遵循的底层结构越多，就越容易计算出有关该对象的信息。这在稳定性和可计算性之间形成了一种来回的关系，这种相互作用是可计算稳定性理论的重点。由可计算稳定性理论引起的问题导致了经典模型理论和可计算性的新问题，这对两个主题都有启示。在这些问题中，量词消除在某种程度上是否可以从几何性质中推导出来。可计算稳定性理论试图探索“结构简单的对象应该更容易计算”这一基本命题。模型理论是数学逻辑的一个分支，它通过在一阶语言的背景下研究对象，提供了分析结构简单性的工具。对与对象或对象类相关的语言的理解通常可以转化为对对象本身的更深层次的理解。可计算性理论研究关于数学对象的计算和相对计算问题。通过结合这两个领域的工具，Andrews将研究结构简单性何时转化为计算简单性，何时转化为计算简单性。

Andrews proposes a program of research spanning classical computability theory, classical model theory, and especially the interplay between computability theory and model theory. More specifically, the proposed research will develop the emerging field of Computable Stability Theory, where the methods of stability theory plays a key role is the study of effective properties of first order theories. Stability theory is the part of model theory which focuses on the underlying geometrical or structural nature of the mathematical objects. Generally speaking, the more underlying structure the mathematical object respects, the easier it is to compute information about the object. This forms a back-and-forth relationship between stability and computability, and this interplay is the focus of Computable Stability Theory. Questions arising from Computable Stability Theory lead to new questions in classical model theory as well as computability, which sheds light on both subjects. Among these questions is when quantifier elimination to some level can be derived from geometrical properties.Computable Stability Theory endeavors to explore the basic statement that "structurally simple objects ought to be easier to compute." Model theory, a branch of mathematical logic, offers tools to analyze structural simplicity by studying objects in the context of their first order language. The understanding of the language associated to an object or class of objects can often be translated to a deeper understanding of the objects themselves. Computability theory studies questions of computation and relative computation with regard to mathematical objects. By combining tools from both fields, Andrews will examine the question of when structural simplicity does and when it does not translate into computational simplicity.