Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms

DOI10.1007/s00153-023-00865-7arXiv2106.12660OpenAlexW3176180624MaRDI QIDQ6103515

Iván Ongay-Valverde

Publication date: 5 June 2023

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.12660

zbMATH Keywords

set theorycomputability theoryTuring equivalenceautomorphism problem

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Applications of set theory (03E75) Models of arithmetic and set theory (03C62) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Cites Work

• Unnamed Item
• Unnamed Item
• On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
• Definability in the Turing degrees
• Martin's axiom does not imply that every two \(chi_ 1-\)dense sets of reals are isomorphic
• Turing cones and set theory of the reals
• Iterated Cohen extensions and Souslin's problem
• On the degrees less than 0'
• Partition Problems in Topology
• Countable initial segments of the degrees of unsolvability
• Αll $ℵ_1$-dense sets of reals can be isomorphic
• Degrees of unsolvability of continuous functions
• Degrees of Unsolvability. (AM-55)
• Recursive Real Numbers