Computable model theory and invariant descriptive computability theory

数理逻辑的产生是因为需要为数学建立严格的基础。在数理逻辑中，研究了三个主要的子领域。模型论通过形式语言的透镜来理解数学对象。可计算性理论通过计算复杂性的透镜来理解数学对象。集合论通过数学的基本公理以及这些公理如何暗示对象的存在来理解数学对象。这个项目的重点是可计算性理论和其他两个逻辑子领域之间的一些联系。关于模型论，该项目涉及探索当两个数学对象在其形式语言方面看起来相同时的现象，但一个可以计算，而另一个不能。在集合论中，有一个丰富的理论探索二维集合的复杂性，在建设性地嵌入一个到另一个。这些嵌入可以用集合论中的并和补的基本运算来构造，但它们可能是不可计算的。该项目将探索一个类似的理论，其中一个认为嵌入必须是可计算的。这个项目涉及与本科生和研究生的工作。一阶理论的可计算谱要求该理论模型的哪些维度是可计算的。可计算模型理论中的谱问题，自70年代以来一直是一个主要的开放问题，要求哪些集合可以是不可数范畴理论的可计算谱，重点是强极小理论。在这个项目中，我们的目标是从一个完全通用的框架到局部模块化的强极小理论，这是几何驯服，并密切相关的群体的问题减少。从那里，希望能够给出具体的答案，哪些集合是光谱。另外，这个项目将研究等价关系的可计算约简。一个主要的方向是使用这种复杂性的概念来详细研究代数决策问题。在过去，图灵度被用来分析代数决策问题，但这些形成了一个粗略的尺度，所以所有可计算的可计算度似乎包含了所有自然的代数决策问题。利用等价关系的可计算约简，应该会出现一个更有趣的结构。该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的知识价值和更广泛的影响审查标准进行评估来支持。

Mathematical logic grew out of a need to develop rigorous foundations for mathematics. Within mathematical logic, three major subfields are studied. Model theory understands mathematical objects by considering them through the lens of a formal language. Computability theory understands mathematical objects by considering them through the lens of computational complexity. Set theory understands mathematical objects through the foundational axioms of mathematics and how those axioms imply the object’s existence. This project focuses on some connections between computability theory and the other two subfields of logic. Regarding model theory, the project involves exploring the phenomenon when two mathematical objects look the same in terms of their formal languages, but one can be computed while the other cannot. In set theory, there is a rich theory exploring the complexity of 2-dimensional sets in terms of constructively embedding one into another. These embeddings are constructible in terms of the basic set-theoretic operations of unions and complements, but they may not be computable. The project will explore an analogous theory where one considers embeddings that must be computable. This project involves work with undergraduate and graduate students. The computable spectrum of a first-order theory asks which dimensions of models of that theory are computable. The spectrum problem in computable model theory, which has been a major open problem since the 70s, asks for which sets may be computable spectra of uncountably categorical theories, with a focus on strongly minimal theories. In this project, the aim is to give a reduction of the problem from a fully general framework down to the locally modular strongly minimal theories, which are geometrically tame and are closely related to groups. From there, the hope is to be able to give concrete answers as to which sets are spectra. Separately, this project will examine computable reduction on equivalence relations. One major direction is to use this complexity notion to examine algebraic decision problems in detail. In the past, the Turing degrees have been used to analyze algebraic decision problems, but these form a coarse yardstick, so all computably enumerable degrees seem to contain all natural algebraic decision problems. Using computable reductions on equivalence relations, there should be a much more interesting structure emerging.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.