Lowness for genericity
From MaRDI portal
Publication:818521
DOI10.1007/S00153-005-0306-YzbMATH Open1148.03033OpenAlexW2139507368MaRDI QIDQ818521FDOQ818521
Publication date: 21 March 2006
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-005-0306-y
Recommendations
Cites Work
- Algorithmic Randomness and Complexity
- The definition of random sequences
- Lowness properties and randomness
- Computational randomness and lowness
- Title not available (Why is that?)
- ∏ 0 1 Classes and Degrees of Theories
- The Degrees of Hyperimmune Sets
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
Cited In (22)
- Measure-theoretic applications of higher Demuth's theorem
- Weakly Represented Families in Reverse Mathematics
- Generics for computable Mathias forcing
- COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
- Domination, forcing, array nonrecursiveness and relative recursive enumerability
- Agreement reducibility
- DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Nullifying randomness and genericity using symmetric difference
- Dominating the Erdős-Moser theorem in reverse mathematics
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- Genericity, generosity, and tori
- Lowness for Kurtz randomness
- Bounding non-GL2 and R.E.A.
- Relative enumerability and 1-genericity
- Generic saturation
- Lowness of higher randomness notions
- On the uniform computational content of computability theory
- Theory and Applications of Models of Computation
- Continuous higher randomness
- HIGHER RANDOMNESS AND GENERICITY
- Relativized Schnorr tests with universal behavior
This page was built for publication: Lowness for genericity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818521)
