A cohesive set which is not high
From MaRDI portal
Publication:4304787
DOI10.1002/malq.19930390153zbMath0799.03048OpenAlexW1981894804MaRDI QIDQ4304787
Carl G. jun. Jockusch, Frank Stephan
Publication date: 1993
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19930390153
jumpscohesive setmaximal setdegrees of unsolvabilityprimitive recursive analoguesstrongly hyperhyperimmune setsstrongly hyperimmune set
Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)
Related Items
An inside/outside Ramsey theorem and recursion theory, 2000 Annual Meeting of the Association for Symbolic Logic, Inductive inference and reverse mathematics, Term extraction and Ramsey's theorem for pairs, Asymptotic density, immunity and randomness, Iterative Forcing and Hyperimmunity in Reverse Mathematics, NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, Dominating the Erdős-Moser theorem in reverse mathematics, THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY, Cohesive sets and rainbows, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Ramsey’s theorem for singletons and strong computable reducibility, MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY, Effective versions of Ramsey's Theorem: Avoiding the cone above 0′, On the uniform computational content of computability theory, Controlling iterated jumps of solutions to combinatorial problems, \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs, Weakly Represented Families in Reverse Mathematics, Weaker cousins of Ramsey's theorem over a weak base theory, Degrees bounding principles and universal instances in reverse mathematics, Reverse mathematics and a Ramsey-type König's Lemma, On the strength of Ramsey's theorem for pairs, The cohesive principle and the Bolzano-Weierstraß principle, The weakness of being cohesive, thin or free in reverse mathematics, Jump inversions inside effectively closed sets and applications to randomness, Schnorr trivial sets and truth-table reducibility, On the indecomposability of \(\omega^n\), The canonical Ramsey theorem and computability theory, The Rado path decomposition theorem, Partition Theorems and Computability Theory, \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models, Ramsey's theorem and cone avoidance, Low sets without subsets of higher many-one degree, The atomic model theorem and type omitting, Pigeons do not jump high, Corrigendum to: “On the strength of Ramsey's Theorem for pairs”, Cohesive avoidance and strong reductions, On the degrees of constructively immune sets
Cites Work
