Lowness for genericity

DOI10.1007/S00153-005-0306-YMaRDI QIDQ818521zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Theory and Applications of Models of Computation
• Lowness for isomorphism and degrees of genericity
• Lowness for Kurtz randomness
• Enumeration 1-genericity in the local enumeration degrees
• Hyperimmune-free degrees and Schnorr triviality

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• Algorithmic randomness and complexity.
• Computational randomness and lowness
• Lowness properties and randomness
• 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

Cited in

(25)

• Measure-theoretic applications of higher Demuth's theorem
• Lowness for isomorphism, countable ideals, and computable traceability
• Generics for computable Mathias forcing
• Weakly represented families in reverse mathematics
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Agreement reducibility
• Nullifying randomness and genericity using symmetric difference
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• Higher randomness and genericity
• Dominating the Erdős-Moser theorem in reverse mathematics
• Genericity, generosity, and tori
• Lowness for Kurtz randomness
• Bounding non-GL₂ and R.E.A.
• Relative enumerability and 1-genericity
• Generic saturation
• Density-1-bounding and quasiminimality in the generic degrees
• The finite intersection principle and genericity
• Lowness of higher randomness notions
• On the uniform computational content of computability theory
• Open questions about Ramsey-type statements in reverse mathematics
• Theory and Applications of Models of Computation
• Coarse reducibility and algorithmic randomness
• Lowness for isomorphism and degrees of genericity
• Relativized Schnorr tests with universal behavior
• Continuous higher randomness

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)