Lowness for genericity

DOI10.1007/s00153-005-0306-yzbMath1148.03033OpenAlexW2139507368MaRDI QIDQ818521

Liang Yu

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

zbMATH Keywords

Turing degree structures

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (19)

Nullifying randomness and genericity using symmetric difference ⋮ Relative enumerability and 1-genericity ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Agreement reducibility ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ On the uniform computational content of computability theory ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES ⋮ Weakly Represented Families in Reverse Mathematics ⋮ COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS ⋮ Generics for computable Mathias forcing ⋮ Domination, forcing, array nonrecursiveness and relative recursive enumerability ⋮ Lowness of higher randomness notions ⋮ Relativized Schnorr tests with universal behavior ⋮ Lowness for Kurtz randomness ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Bounding non-GL₂ and R.E.A. ⋮ Continuous higher randomness

Cites Work

• Unnamed Item
• Lowness properties and randomness
• Computational randomness and lowness
• Algorithmic Randomness and Complexity
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• The Degrees of Hyperimmune Sets
• The definition of random sequences
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Lowness for genericity