✦ LIBER ✦

Initial Segments of Turing Degrees

✍ Scribed by Hugill, D. F.

Book ID: 120102314
Publisher: Oxford University Press
Year: 1969
Tongue: English
Weight: 361 KB
Volume: s3-19
Category: Article
ISSN: 0024-6115
DOI: 10.1112/plms/s3-19.1.1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On initial segments of degrees of constr

On initial segments of degrees of constructibility

✍ V. G. Kanovei 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 290 KB

Minimal pairs in initial segments of the

Minimal pairs in initial segments of the recursively enumerable degrees

✍ R. Downey; M. Stob 📂 Article 📅 1997 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 948 KB

tt-Degrees of recursively enumerable tur

tt-Degrees of recursively enumerable turing degrees. II

✍ G. N. Kobzev 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 597 KB

On relative enumerability of Turing degr

On relative enumerability of Turing degrees

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

Embedding of Countable Orders in Turing

Embedding of Countable Orders in Turing Degrees

✍ Sh.T. Ishmukhametov 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 117 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