✦ LIBER ✦

Definable relations in Turing degree structures

✍ Scribed by Arslanov, M. M.

Book ID: 121539978
Publisher: Allerton Press, Inc.
Year: 2014
Tongue: English
Weight: 481 KB
Volume: 58
Category: Article
ISSN: 1066-369X
DOI: 10.3103/S1066369X1402011X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The Degree Spectra of Definable Relation

The Degree Spectra of Definable Relations on Boolean Algebras

✍ P. M. Semukhin 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 188 KB

Some Remarks on Definable Equivalence Re

Some Remarks on Definable Equivalence Relations in O-Minimal Structures

✍ Anand Pillay 📂 Article 📅 1986 🏛 Association for Symbolic Logic 🌐 English ⚖ 162 KB

Structures definable in polymorphism

✍ Yuxi Fu 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 558 KB

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

Maximal Chains in the Turing Degrees

✍ C. T. Chong and Liang Yu 📂 Article 📅 2007 🏛 Association for Symbolic Logic 🌐 English ⚖ 752 KB