Roland Sh. Omanadze

Orcid: 0000-0002-0215-7912

According to our database1, Roland Sh. Omanadze authored at least 17 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On b Q 1 $bQ_1$ -degrees of c.e. sets.
Math. Log. Q., February, 2024

2023
sQ<sub>1</sub>-degrees of computably enumerable sets.
Arch. Math. Log., May, 2023

Project Presentation: Recursive Functions and Engineering Probabilistic Ontologies.
Proceedings of the 19th IEEE International Conference on e-Science, 2023

2022
Degree structures of conjunctive reducibility.
Arch. Math. Log., 2022

2021
r-Maximal sets and Q 1 , N -reducibility.
Math. Log. Q., 2021

Notes on conjunctive and Quasi degrees.
J. Log. Comput., 2021

2019
On the connections between wttwttwttwttwtt- and QQ[Math Processing Error]Q-reducibilities.
J. Log. Comput., 2019

2018
Some structural properties of quasi-degrees.
Log. J. IGPL, 2018

2015
Some properties of maximal sets.
Log. J. IGPL, 2015

Some properties of r-maximal sets and Q 1, N -reducibility.
Arch. Math. Log., 2015

2013
On the bounded quasi-degrees of c.e. sets.
Math. Log. Q., 2013

2012
Q 1-degrees of c.e. sets.
Arch. Math. Log., 2012

2011
Immunity properties and strong positive reducibilities.
Arch. Math. Log., 2011

2008
A characterization of the Delta<sup>0</sup><sub>2</sub> hyperhyperimmune sets.
J. Symb. Log., 2008

Structural properties of Q-degrees of n-c. e. sets.
Ann. Pure Appl. Log., 2008

2006
Strong Enumeration Reducibilities.
Arch. Math. Log., 2006

2004
Splittings of effectively speedable sets and effectively levelable sets.
J. Symb. Log., 2004


  Loading...