Relatively computably enumerable reals
From MaRDI portal
Publication:535150
DOI10.1007/S00153-010-0219-2zbMATH Open1227.03053arXiv0705.0776OpenAlexW3101046215MaRDI QIDQ535150FDOQ535150
Authors: Bernard Anderson
Publication date: 11 May 2011
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Abstract: A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of the complement of X such that Z is c.e.(Y). We prove that every nonempty Pi^0_1 class contains a member which is not relatively c.e. and that every 1-generic real is relatively simple and above.
Full work available at URL: https://arxiv.org/abs/0705.0776
Recommendations
Computation over the reals, computable analysis (03D78) Recursively (computably) enumerable sets and degrees (03D25)
Cites Work
Cited In (10)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Presentations of computably enumerable reals.
- Title not available (Why is that?)
- A Note on the Differences of Computably Enumerable Reals
- Regular reals
- Spectrum of the field of computable real numbers
- Effectively infinite classes of numberings of computable families of reals
- Relative enumerability and 1-genericity
- Relative definability of \(n\)-generics
- The approximation structure of a computably approximable real
This page was built for publication: Relatively computably enumerable reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535150)