✦ LIBER ✦

Ershov hierarchy and the t-jump

✍ Scribed by V. L. Selivanov

Book ID: 105424180
Publisher: Springer US
Year: 1988
Tongue: English
Weight: 794 KB
Volume: 27
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01978401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turing jumps in the Ershov hierarchy

✍ M. Kh. Faizrakhmanov 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 338 KB

Computable categoricity and the Ershov h

Computable categoricity and the Ershov hierarchy

✍ Bakhadyr Khoussainov; Frank Stephan; Yue Yang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Decomposability of low 2-computably enum

Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy

✍ M. Kh. Faizrakhmanov 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 538 KB

Computable numberings of families of low

Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy

✍ M.Kh. Faizrahmanov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 134 KB

On Genericity and Ershov's Hierarchy

✍ Amy Gale; Rod Downey 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

Recursive Structures and Ershov's Hierar

Recursive Structures and Ershov's Hierarchy

✍ Christopher J. Ash; Julia F. Knight 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB

Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r.e. Here we generalize this to arbitrary levels in Ershov's hierarchy of A: sets, giving conditions under which a relation is intrinsically a-r. e.