TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES-Reference-Cited by-同舟云学术

TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES

Published:2007-12 Issue:02 Volume:07 Page:145-171
ISSN:0219-0613
Container-title:Journal of Mathematical Logic
language:en
Short-container-title:J. Math. Log.

Author:

DOWNEY ROD¹,GREENBERG NOAM¹,WEBER REBECCA²

Affiliation:

1. School of Mathematics, Statistics and Computer Science, Victoria University, P. O. Box 600, Wellington, New Zealand

2. Department of Mathematics, Dartmouth College, 6188 Kemeny Hall, Hanover NH 03755-3551, USA

Abstract

We characterize the class of c.e. degrees that bound a critical triple (equivalently, a weak critical triple) as those degrees that compute a function that has no ω-c.e. approximation.

Publisher

World Scientific Pub Co Pte Lt

Subject

Logic

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219061307000640

Reference19 articles.

1. Embeddings of N5 and the contiguous degrees

2. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees

3. Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees

4. Array nonrecursive sets and multiple permitting arguments

5. Array nonrecursive degrees and genericity

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards characterizing the >ω2-fickle recursively enumerable Turing degrees;Annals of Pure and Applied Logic;2024-04

2. NOTES ON SACKS’ SPLITTING THEOREM;The Journal of Symbolic Logic;2023-10-26

3. A classification of low c.e. sets and the Ershov hierarchy;Mathematical Logic Quarterly;2023-09-11

4. SPLITTING OF C.E. DEGREES AND SUPERLOWNESS;SIB ELECTRON MATH RE;2022

5. Nonlowness is independent from fickleness;Computability;2021-10-07