Turing degrees of isomorphism types of geometric objects
classification
🧮 math.LO
math.AG
keywords
degreeleastturingcomputability-theoreticcopydegreesfailgeometric
read the original abstract
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures may fail to have a least degree.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.