Электронный архив

Просмотр Публикации сотрудников КФУ Scopus по автору "Arslanov M."

Просмотр Публикации сотрудников КФУ Scopus по автору "Arslanov M."

Отсортировать по:Сортировать:Результаты поиска на странице:

  • A note on minimal and maximal ideals of ordered semigroups 
    Arslanov M.; Kehayopulu N. (2002)
    Ideals of ordered groupoids were defined by second author in [2]. Considering the question under what conditions an ordered semigroup (or semigroup) contains at most one maximal ideal we prove that in an ordered groupoid ...
  • A survey of results on the d-c.e. and n-c.e. degrees 
    Arslanov M.; Kalimullin I. (2017)
    © Springer International Publishing AG 2017.This paper is a survey on the upper semilattices of Turing and enumeration degrees of n-c.e. sets. Questions on the structural properties of these semilattices, and some ...
  • Contributions to the history of variations of weak density in the n-R.E. Degrees 
    Arslanov M. (1995)
  • Definable relations in Turing degree structures 
    Arslanov M. (2014)
    In this paper we investigate questions about the definability of classes of n-computably enumerable (c. e.) sets and degrees in the Ershov difference hierarchy. It is proved that the class of all c. e. sets is definable ...
  • Definable relations in Turing degree structures 
    Arslanov M. (2013)
    In this article, we investigate questions about the definability of classes of n-c. e. sets and degrees in the Ershov difference hierarchy. © 2013 The Author, 2013. Published by Oxford University Press. All rights reserved.
  • Elementary theories and structural properties of d-c.e. and n-c.e. degrees 
    Arslanov M.; Kalimullin I.; Yamaleev M. (2016)
    © 2016, Pleiades Publishing, Ltd.This paper is a survey on the upper semilattices of Turing and enumeration degrees of n-c.e. sets. Questions on the structural properties of these semilattices, and some model-theoretic ...
  • Interpolating d-r.e. and REA degrees between r.e. degrees 
    Arslanov M.; Lempp S.; Shore R. (1996)
    We provide three new results about interpolating 2-r.e. (i.e. d-r.e.) or 2-REA (recursively enumerable in and above) degrees between given r.e. degrees: Proposition 1.13. If c < h are r.e., c is low and h is high, then ...
  • Model-theoretic properties of the m-c.e. degrees 
    Arslanov M. (2012)
    In this article, we investigate model-theoretic properties of various Turing degree structures in the hierarchy of Δ 0 2-sets which is well known in the literature as Ershov Hierarchy. In particular, questions of definability ...
  • On downey's conjecture 
    Arslanov M.; Kalimullin I.; Lempp S. (2010)
    We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the ...
  • On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy 
    Arslanov M.; Yamaleev M. (2018)
    © 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied. Several approaches ...
  • Q-degrees of n-C.E. sets 
    Arslanov M.; Omanadze R. (2008)
    In this paper we study Q-degrees of n-computably enumerable (n-c.e.) sets. It is proved that n-c.e. sets form a true hierarchy in terms of Q-degrees, and that for any n ≥ 1 there exists a 2n-c.e. Q- degree which bounds no ...
  • Splitting and nonsplitting in the Σ2 0 enumeration degrees 
    Arslanov M.; Cooper S.; Kalimullin I.; Soskova M. (2011)
    This paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], of describing general conditions under which relative splittings are derivable in the local structure of the enumeration degrees, ...
  • Structural properties of Q-degrees of n-c. e. sets 
    Arslanov M.; Batyrshin I.; Omanadze R. (2008)
    In this paper we study structural properties of n-c. e. Q-degrees. Two theorems contain results on the distribution of incomparable Q-degrees. In another theorem we prove that every incomplete Π2 0 Q-degree forms a minimal ...
  • Structural Theory of Degrees of Unsolvability: Advances and Open Problems 
    Arslanov M. (2015)
    © 2015, Springer Science+Business Media New York. Presented by the Program Committee of the Conference “Mal’tsev Readings”
  • The minimal e-degree problem in fragments of Peano arithmetic 
    Arslanov M.; Chong C.; Cooper S.; Yang Y. (2005)
    We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: in any model M of Σ2 induction, there is a minimal enumeration degree if and only ...
  • There is no low maximal d. c. e. degree 
    Arslanov M.; Cooper S.; Li A. (2000)
    We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A, then there is a c. e. splitting A0 ∐ A1 = A such that Ai ⊗ L <T A. In particular, if L is low and n-c. e., then Ai ⊗ L ...
  • There is no low maximal d. c. e. degree - Corrigendum 
    Arslanov M.; Cooper S.; Li A. (2004)
    We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees. © 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
  • Total degrees and nonsplitting properties of ∑2 0 enumeration degrees 
    Arslanov M.; Cooper S.; Kalimullin I.; Soskova M. (2008)
    This paper continues the project, initiated in [ACK], of describing general conditions under which relative splittings are derivable in the local structure of the enumeration degrees. The main results below include a proof ...

Поиск в электронном архиве


Расширенный поиск

Просмотр

Моя учетная запись