𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on degrees of presentation of games as relational structures

✍ Scribed by Alain A. Lewis

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
472 KB
Volume
19
Category
Article
ISSN
0165-4896

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

Degree spectra of relations on structure
Degree spectra of relations on structures of finite computable dimension
✍ Denis R. Hirschfeldt πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 415 KB

We show that for every computably enumerable (c.e.) degree aΒΏ0 there is an intrinsically c.e. relation on the domain of a computable structure of computable dimension 2 whose degree spectrum is {0; a}, thus answering a question of Goncharov and Khoussainov (Dokl. Math. 55 (1997) 55-57). We also show