The following pages link to Roland Sh. Omanadze (Q535144):
Displaying 20 items.
- On a problem of Ishmukhametov (Q377474) (← links)
- \(Q _{1}\)-degrees of c.e. sets (Q453193) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- A superhigh diamond in the c.e. tt-degrees (Q627429) (← links)
- Elementary differences between the degrees of unsolvability and degrees of compressibility (Q636334) (← links)
- Upper bounds on ideals in the computably enumerable Turing degrees (Q639654) (← links)
- Empty intervals in the enumeration degrees (Q764276) (← links)
- A minimal upper bound on a sequence of Turing degrees which represents that sequence (Q798318) (← links)
- Strong enumeration reducibilities (Q850805) (← links)
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility (Q892147) (← links)
- Structural properties of \(Q\)-degrees of n-c.e. sets (Q958482) (← links)
- The jump operator on the \(\omega \)-enumeration degrees (Q1032630) (← links)
- A non-splitting theorem in the enumeration degrees (Q1032639) (← links)
- Infima of recursively enumerable truth table degrees (Q1114676) (← links)
- Infima in the recursively enumerable weak truth table degrees (Q1130238) (← links)
- On \(\Pi{}^ 0_ 1\) classes and their ranked points (Q1182688) (← links)
- On the r. e. predecessors of d. r. e. degrees (Q1306796) (← links)
- Rank, join, and Cantor singletons (Q1387096) (← links)
- On the distribution of Lachlan nonsplitting bases (Q1407550) (← links)
- Every incomplete computably enumerable truth-table degree is branching (Q5931217) (← links)
