Degree spectra of relations on structures of finite computable dimension (Q1612487)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree spectra of relations on structures of finite computable dimension |
scientific article |
Statements
Degree spectra of relations on structures of finite computable dimension (English)
0 references
22 August 2002
0 references
The author proves that for every c.e. (\(\alpha\)-c.e., \(\alpha\in\omega\cup\{\omega\}\)) degree \(\mathbf d>0\) there is a computable structure whose algorithmic dimension is 2 and an intrinsically c.e. (\(\alpha\)-c.e.) relation on it such that its degree spectrum is \textbf{\{0,d\}}. Some generalizations and variations of this result are also considered.
0 references
degree spectra of relation
0 references
computable structure
0 references
computable dimension
0 references
computable model
0 references
recursive model
0 references
0 references
