𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On relative enumerability of Turing degrees

✍ Scribed by Shamil Ishmukhametov

Publisher
Springer
Year
2000
Tongue
English
Weight
89 KB
Volume
39
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Turing degrees of points in computabl
On Turing degrees of points in computable topology
✍ Iraj Kalantari; Larry Welch πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract This paper continues our study of computable point‐free topological spaces and the metamathematical points in them. For us, a __point__ is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a __sharp filter__. A function __f~F~__

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

Turing degrees of certain isomorphic ima
Turing degrees of certain isomorphic images of computable relations
✍ Valentina S. Harizanov πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 683 KB

A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let ~2 be a computable model and let R be an extra relation on the domain of &. That is, R is not named in the language of .d. We define Dgd(R) to be the set of Turing degrees of the ima