✦ LIBER ✦

On the Turing degrees of minimal index sets

✍ Scribed by Jason Teutsch

Book ID: 108054626
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 370 KB
Volume: 148
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2007.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The index sets of m-degrees

✍ S. Kallibekov 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 646 KB

On relative enumerability of Turing degr

On relative enumerability of Turing degrees

✍ Shamil Ishmukhametov 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 89 KB

On btt-Degrees of Sets of Minimal Number

On btt-Degrees of Sets of Minimal Numbers in Gödel Numberings

✍ Jefim Kinber 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 686 KB

Index sets of degrees of unsolvability

✍ S. Kallibekov 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 568 KB

Minimal Degrees and Recursively Insepara

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

✍ Manuel Lerman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

Turing degrees of hypersimple relations

Turing degrees of hypersimple relations on computable structures

✍ Valentina S. Harizanov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Let A be an inÿnite computable structure, and let R be an additional computable relation on its domain A. The syntactic notion of formal hypersimplicity of R on A, ÿrst introduced and studied by Hird, is analogous to the computability-theoretic notion of hypersimplicity of R on A, given the deÿnabil