Turing degrees of hypersimple relations on computable structures (Q1399102)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turing degrees of hypersimple relations on computable structures |
scientific article |
Statements
Turing degrees of hypersimple relations on computable structures (English)
0 references
30 July 2003
0 references
The author studies spectral type questions for distinguished \(R\) relations on computable structures \(A\). Assuming the relation in question is formally hypersimple, a syntactic condition introduced by \textit{G. R. Hird} [in his thesis and in Ann. Pure Appl. Logic 63, 241-269 (1993; Zbl 0793.03036)]. The author gives general syntactic conditions for the existence of a computable copy of \(A\) containing a hypersimple copy of \(R\) in each non-zero Turing degree. Applications include some results of Remmel on Boolean algebras.
0 references
computable structure
0 references
hypersimple relation
0 references
Turing degree
0 references