Turing Degrees of Isomorphism Types of Geometric Objects

Autor:	Alexandra Shlapentokh, Valentina S. Harizanov, Wesley Calvert
Rok vydání:	2014
Předmět:	Turing degree Description number 01 natural sciences Theoretical Computer Science Combinatorics Mathematics - Algebraic Geometry 010104 statistics & probability symbols.namesake Post's theorem PA degree Turing completeness Artificial Intelligence FOS: Mathematics 0101 mathematics Algebraic Geometry (math.AG) Turing Mathematics computer.programming_language Hyperarithmetical theory 010102 general mathematics Mathematics - Logic 03C60 03D28 13L05 Computer Science Applications Computational Theory and Mathematics symbols Time hierarchy theorem Logic (math.LO) computer
Zdroj:	Computability. 3:105-134
ISSN:	2211-3568
DOI:	10.3233/com-140029
Popis:	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. Comment: This version contains new introduction and corrections of minor errors
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1237c3f733fa4c368ab314edde7213bd https://doi.org/10.3233/com-140029 Zobrazit plný text záznamu