Omitting cohesive sets

MaRDI QIDQ2923569zbMATH OpenFDO

Authors Wei Wang

Publication date 3 November 2014

Published in Journal of Nanjing University. Mathematical Biquarterly (Search for Journal in Brave)

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

zbMATH Keywords

cohesive setMartin-Löf random setreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Abstract: We prove that if $vecR$ is a computable sequence of subsets of $omega$ which admits no computable cohesive set, then no 3-generic computes any $vecR$-cohesive set; and there exists a Martin-L"{o}f random which computes no $vecR$-cohesive set.

Recommendations

• Cohesive avoidance and strong reductions
• Generalized cohesiveness
• A cohesive set which is not high
• Generic computability, Turing degrees, and asymptotic density
• Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness”

Cited in

(4)

• Generalized cohesiveness
• A cohesive set which is not high
• Cohesive powers of computable structures
• The weakness of being cohesive, thin or free in reverse mathematics

This page was built for publication: Omitting cohesive sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923569)