Affiliation:
1. School of Mathematics and Statistics, Victoria University of Wellington, Wellington, New Zealand
Abstract
We study the primitive recursive content of various closure results in algebra and model theory, including the algebraic, the real, and the differential closure theorems. In the case of ordered fields and their real closures, our result settles a question recently raised by Selivanova and Selivanov.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference47 articles.
1. Existence and uniqueness of structures computable in polynomial time;Alaev;Algebra and Logic,2016
2. Categoricity for primitively recursive and polynomial Boolean algebras;Alaev;Algebra Logika,2018
3. Finitely generated structures computable in polynomial time;Alaev;Sib. Math. J.,2022
4. Fields of algebraic numbers computable in polynomial time. II;Alaev;Algebra Logic,2021
5. P.E. Alaev and V.L. Selivanov, Searching for applicable versions of computable structures, in: Connecting with Computability, Lecture Notes in Comput. Sci., Vol. 12813, Springer, Cham, 2021, pp. 1–11.